Results 1 to 10 of about 99,592 (142)
Low Complexity Coefficient Selection Algorithms for Compute-and-Forward
IEEE Access, 2017 Compute-and-forward (C&F) has been proposed as an efficient strategy to reduce the backhaul load for distributed antenna systems. Finding the optimal coefficients in C&F has commonly been treated as a shortest vector problem, which is NP-hard ...
Qinhui Huang, Alister Burr
doaj +3 more sources
ITM Web of Conferences, 2018 Regarding polynomial functions on a subset S of a non-commutative ring R, that is, functions induced by polynomials in R[x] (whose variable commutes with the coeffcients), we show connections between, on one hand, sets S such that the integer-valued ...
Frisch Sophie
doaj +2 more sources
Relative polynomial closure and monadically Krull monoids of integer-valued polynomials [PDF]
, 2015 Let D be a Krull domain and Int(D) the ring of integer-valued polynomials on D. For any f in Int(D), we explicitly construct a divisor homomorphism from [f], the divisor-closed submonoid of Int(D) generated by f, to a finite sum of copies of (N_0 ...
Frisch, Sophie
core +2 more sources
Redactable blockchains with integer-valued polynomials
Blockchain: Research and ApplicationsBlockchain technology has rapidly ascended as a pivotal innovation in the financial sector, renowned for its robust tamper-resistant properties inherent in hash-based systems.
Udomsak Rakwongwan +2 more
doaj +2 more sources
Warm-starting quantum optimization [PDF]
Quantum, 2021 There is an increasing interest in quantum algorithms for problems of integer programming and combinatorial optimization. Classical solvers for such problems employ relaxations, which replace binary variables with continuous ones, for instance in the ...
Daniel J. Egger +2 more
doaj +1 more source
Equalizing ideal for integer-valued polynomials over the upper triangular matrix ring [PDF]
ریاضی و جامعه, 2023 Let $D$ be an integral domain and $I$ be an ideal of the upper trangular matrix ring $T_{n}(D)$. In this paper, we study the equalizing ideal$$q_{I}=\{A\in T_n(D)|f(A)-f(0)\in I,\forall f\in {\operatorname{Int}}(T_n(D))\}.$$of the integer-valued ...
Ali Reza Naghipour
doaj +1 more source
Computing discrete logarithm by interval-valued paradigm [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure.
Benedek Nagy, Sándor Vályi
doaj +1 more source
Integer-valued polynomials and binomially Noetherian rings
Zanco Journal of Pure and Applied Sciences, 2022 for each and i ≥ 0. The polynomial ring of integer-valued in rational polynomial is defined by Int ( an important example for binomial ring and is non-Noetherian ring. In this paper the algebraic structure of binomial rings has been studied by their
Shadman Kareem
doaj +1 more source
How many qubits are needed for quantum computational supremacy? [PDF]
Quantum, 2020 Quantum computational supremacy arguments, which describe a way for a quantum computer to perform a task that cannot also be done by a classical computer, typically require some sort of computational assumption related to the limitations of classical ...
Alexander M. Dalzell +3 more
doaj +1 more source
Infectious Disease Modelling, 2021 In this paper we forecast the spread of the coronavirus disease 2019 outbreak in Italy in the time window from May 19 to June 2, 2020. In particular, we consider the forecast of the number of new daily confirmed cases.
Marco Triacca, Umberto Triacca
doaj +1 more source