A note on PCP vs. MIP

DOI10.1016/0020-0190(96)00043-9MaRDI QIDQ1350618zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Amnon Ta-Shma

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00043-9

zbMATH Keywords

AlgorithmsComplexityInteractive proof system

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Parallel algorithms in computer science (68W10)

Recommendations

• On the power of multi-prover interactive protocols
• Alternation in interaction
• scientific article; zbMATH DE number 512981

Cites work

• Efficient probabilistically checkable proofs and applications to approximations
• scientific article; zbMATH DE number 1256635 (Why is no real title available?)
• On the power of multi-prover interactive protocols

Cited in

(1)

• Hardness of approximate two-level logic minimization and PAC learning with membership queries

This page was built for publication: A note on PCP vs. MIP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1350618)