Probabilistic Proof Systems: A Primer
DOI10.1561/0400000023zbMath1195.68048OpenAlexW4206014747MaRDI QIDQ3530806
Publication date: 20 October 2008
Published in: Foundations and Trends® in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1561/0400000023
randomizationinteractive proofszero-knowledge proofsproof systemsprobabilistically checkable proofscomplexity classes
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Complexity of proofs (03F20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
This page was built for publication: Probabilistic Proof Systems: A Primer