Sciweavers

33 search results - page 1 / 7
» coco 2009
Sort
View
116
Voted
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
16 years 12 days ago
The Complexity of the Annihilating Polynomial
Neeraj Kayal
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
16 years 12 days ago
Every Permutation CSP of arity 3 is Approximation Resistant
Moses Charikar, Venkatesan Guruswami, Rajsekar Man...
COCO
2009
Springer
75views Algorithms» more  COCO 2009»
16 years 12 days ago
Worst-Case Running Times for Average-Case Algorithms
Luis Filipe Coelho Antunes, Lance Fortnow