1379 search results - page 93 / 276 » The Complexity of the Annihilating Polynomial |
153
click to vote
ATAL
2009
Springer
16 years 27 days ago
2009
Springer
Knockout tournaments constitute a common format of sporting events, and also model a specific type of election scheme (namely, sequential pairwise elimination election). In such ...
173
click to vote
MFCS
2009
Springer
16 years 26 days ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
155
click to vote
TAMC
2009
Springer
16 years 25 days ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
145
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
We study the robustness of complete sets for various complexity classes. A complete set A is robust if for any f(n)-dense set S ∈ P, A−S is still complete, where f(n) ranges f...
218
click to vote
STOC
1999
ACM
15 years 10 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...