1379 search results - page 44 / 276 » The Complexity of the Annihilating Polynomial |
MOC
2011
14 years 5 months ago
2011
We present a new technique, based on polynomial continuation, for solving systems of n polynomials in N complex variables. The method allows equations to be introduced one-by-one o...
JCP
2007
14 years 10 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
102
click to vote
FOCS
1998
IEEE
15 years 2 months ago
1998
IEEE
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
CRYPTO
2007
Springer
15 years 4 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
STACS
2005
Springer
15 years 3 months ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...