Sciweavers

129

Voted

COCO
2008
Springer

95views Algorithms» more COCO 2008»

15 years 5 months ago

We study the average-case hardness of the class NP against deterministic polynomial time algorithms. We prove that there exists some constant

Parikshit Gopalan, Venkatesan Guruswami

claim paper

Read More »