OpenAlex
PricingAboutJobs
Log inGet started
Work

The PCP theorem by gap amplification

HTML

Year: 2006
Type: article
Source: Journal of the ACM
DOI: 10.1145/1236457.1236459
Author: Irit Dinur
Institution: Hebrew University of Jerusalem
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: PCP theorem, hardness of approximation, constraint satisfaction, expander graphs, locally testable codes, NP-hardness of approximation, probabilistically checkable proofs

Open Access status: closed
OpenAlex ID: W336776360
FWCI: 31.34
Cites: 40
Cited by: 717
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms