Sciweavers

21 search results - page 1 / 5
» cocos 2003
Sort
View
COCO
2003
Springer
98views Algorithms» more  COCO 2003»
13 years 9 months ago
The Complexity of Unique k-SAT: An Isolation Lemma for k-CNFs
Chris Calabro, Russell Impagliazzo, Valentine Kaba...
COCO
2003
Springer
88views Algorithms» more  COCO 2003»
13 years 9 months ago
On Derandomizing Tests for Certain Polynomial Identities
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
Manindra Agrawal
COCO
2003
Springer
93views Algorithms» more  COCO 2003»
13 years 9 months ago
Are Cook and Karp Ever the Same?
We consider the question whether there exists a set A such that every set polynomial-time Turing equivalent to A is also many-one equivalent to A. We show that if E = NE then no s...
Richard Beigel, Lance Fortnow