1379 search results - page 60 / 276 » The Complexity of the Annihilating Polynomial |
116
click to vote
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
In this paper, we present a truncated version of the classical Fast Fourier Transform. When applied to polynomial multiplication, this algorithm has the nice property of eliminati...
127
click to vote
CATS
2008
15 years 2 months ago
2008
The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem ...
126
Voted
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
100
click to vote
LICS
2009
IEEE
15 years 7 months ago
2009
IEEE
In a constraint satisfaction problem (CSP) the goal is to find an assignment of a given set of variables subject to specified constraints. A global cardinality constraint is an ...
96
Voted
CASC
2009
Springer
15 years 7 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...