Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

COCO
2008
Springer

favoriteEmaildiscussreport

95views Algorithms» more COCO 2008»

Hardness Amplification within NP against Deterministic Algorithms

13 years 6 months ago

Hardness Amplification within NP against Deterministic Algorithms

Download www.cs.cmu.edu

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

Real-time Traffic

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

claim paper

Related Content

» Hardness amplification within NP

» On uniform amplification of hardness in NP

» The Complexity of the Covering Radius Problem on Lattices and Codes

» Reordering buffers for general metric spaces

Post Info
More Details (n/a)

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

Comments (0)