Proof verification and the hardness of approximation problems

doi:10.1145/278298.278306

Proof verification and the hardness of approximation problems

Full Text:

PDF

Buy this Article

Authors:	Sanjeev Arora	Princeton Univ., Princeton, NJ
	Carsten Lund	AT&T Bell Labs, Murray Hill, NJ
	Rajeev Motwani	Stanford Univ., Stanford, CA
	Madhu Sudan	Massachusetts Institute of Technology, Cambridge
	Mario Szegedy	AT&T Bell Labs, Murray Hill, NJ

	1998 Article
Bibliometrics
· Downloads (6 Weeks): 12 · Downloads (12 Months): 151 · Downloads (cumulative): 2,129 · Citation Count: 286

Published in:

· Journal

Journal of the ACM (JACM) JACM Homepage archive

Volume 45 Issue 3, May 1998
Pages 501-555
ACM New York, NY, USA
table of contents doi>10.1145/278298.278306

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref

Share:

|

Tags: algorithms complexity measures and classes mathematical logic modes of computation nonnumerical algorithms and problems np-completeness numerical algorithms and problems optimization proof verification randomness theory

Feedback | Switch to single page view (no tabs)

**Javascript is not enabled and is required for the "tabbed view" or switch to the single page view**

Powered by

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder