Results 21 to 30 of about 4,447 (309)
Antenna Array Design in MIMO Radar Using NSK Polynomial Factorization Algorithm
International Journal of Antennas and Propagation, 2016 The work presented here is concerned with the antenna array design in collocated multiple-input multiple-output (MIMO) radars. After knowing the system requirements, the antenna array design problem is formulated as a standard polynomial factorization ...
Shuainan Gu +3 more
doaj +1 more source
Tight Polynomial Worst-Case Bounds for Loop Programs [PDF]
Logical Methods in Computer Science, 2020 In 2008, Ben-Amram, Jones and Kristiansen showed that for a simple programming language - representing non-deterministic imperative programs with bounded loops, and arithmetics limited to addition and multiplication - it is possible to decide precisely ...
Amir M. Ben-Amram, Geoff Hamilton
doaj +1 more source
A two-variable approach to solve the polynomial Lyapunov equation [PDF]
, 2001 A two-variable polynomial approach to solve the one-variable polynomial Lyapunov equation is proposed. Lifting the problem from the one-variable to the two-variable context allows to use Faddeev-type recursions in order to solve the polynomial Lyapunov ...
Peeters, Ralf +4 more
core +1 more source
Parallel Quantum Signal Processing Via Polynomial Factorization [PDF]
QuantumQuantum signal processing (QSP) is a methodology for constructing polynomial transformations of a linear operator encoded in a unitary. Applied to an encoding of a state $\rho$, QSP enables the evaluation of nonlinear functions of the form $\text{tr}(P ...
John M. Martyn +4 more
doaj +1 more source
Analysis of the RSA-cryptosystem in abstract number rings
Журнал Белорусского государственного университета: Математика, информатика, 2020 Quantum computers can be a real threat to some modern cryptosystems (such as the RSA-cryptosystem). The analogue of the RSA-cryptosystem in abstract number rings is not affected by this threat, as there are currently no factorization algorithms using ...
Nikita V. Kondratyonok
doaj +1 more source
Attacking cryptosystems by means of virus machines
Scientific Reports, 2023 The security that resides in the public-key cryptosystems relies on the presumed computational hardness of mathematical problems behind the systems themselves (e.g.
Mario J. Pérez-Jiménez +2 more
doaj +1 more source
Matrix factorization ranks via polynomial optimization [PDF]
, 2023 In light of recent data science trends, new interest has fallen in alternative matrix factorizations. By this, we mean various ways of factorizing particular data matrices so that the factors have special properties and reveal insights into the original ...
Steenkamp, J.A.J. (Andries) +1 more
core +1 more source
On generalized Heun equation with some mathematical properties
Acta Polytechnica, 2022 We study the analytic solutions of the generalized Heun equation, (α0 + α1 r + α2 r2 + α3 r3) y′′ + (β0 + β1 r + β2 r2) y′ + (ε0 + ε1 r) y = 0, where |α3| + |β2|≠ 0, and {αi}3i=0, {βi}2i=0, {εi}1i=0 are real parameters.
Nasser Saad
doaj +1 more source
Journal of Symbolic Computation, 1998 Let \(R\) be either \(Z\) or \(F_q [y]\), \(F_q\) the finite field containing \(q\) elements, and let \(r \in R\) be a non-zero non-unit. The aim of the work is to describe all possible factorizations into irreducibles of polynomials in \(R[x]\) over the ring \(R/(r)\) where \((r)\) is the ideal generated by \(r\).
Joachim von zur Gathen, Silke Hartlieb
openaire +2 more sources
Revisiting the Polynomial-Time Equivalence of Computing the CRT-RSA Secret Key and Factoring
Mathematics, 2022 The Rivest–Shamir–Adleman (RSA) cryptosystem is currently the most influential and commonly used algorithm in public-key cryptography. Whether the security of RSA is equivalent to the intractability of the integer factorization problem is an interesting ...
Mengce Zheng
doaj +1 more source