1004 search results - page 7 / 201 » Product representations of polynomials |
ACL2
2006
ACM
14 years 21 days ago
2006
ACM
ACL2 is used to systematically study domains whose elements can be “uniquely” factored into products of “irreducible” elements. The best known examples of such domains are...
AAECC
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We present new faster deterministic and probabilistic recombination algorithms to compute the irreducible decomposition of a bivariate polynomial via the classical Hensel...
JSC
2006
13 years 6 months ago
2006
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multiva...
CORR
2010
Springer
13 years 6 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
2011
13 years 1 months ago
2011
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...