Hardness Amplification within NP against Deterministic Algorithms

14 years 1 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

Algorithms | COCO 2008 | Deterministic Polynomial Time | Log N)-µ Fraction | Polynomial Time Algorithm |

claim paper

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	COCO
Authors	Parikshit Gopalan, Venkatesan Guruswami

Comments (0)