358 search results - page 8 / 72 » Sparse squares of polynomials |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
JC
2007
13 years 7 months ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
JAT
2006
13 years 7 months ago
2006
Abstract. Recently M. Dritschel proved that any positive multivariate Laurent polynomial can be factorized into a sum of square magnitudes of polynomials. We first give another pro...
JACM
2000
13 years 7 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...