Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Madhu Sudan, Luca Trevisan. Probabilistically Checkable Proofs with Low Amortized Query Complexity. In FOCS. pages 18-27, 1998. [doi]
Possibly Related PublicationsThe following publications are possibly variants of this publication: Probabilistically checkable proofs with low amortized query complexityMadhu Sudan, Luca Trevisan. eccc, 5(40), 1998. [doi] A PCP characterization of NP with optimal amortized query complexityAlex Samorodnitsky, Luca Trevisan. stoc 2000: 191-199 [doi] Probabilistically checkable proofsMadhu Sudan. CACM, 52(3):76-84, 2009. [doi]
The following publications are possibly variants of this publication: