Transparent (holographic) proofs
- 1 January 1993
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 525-534
- https://doi.org/10.1007/3-540-56503-5_52
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Algebraic methods for interactive proof systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1992
- Proof verification and hardness of approximation problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Non-deterministic exponential time has two-prover interactive protocolscomputational complexity, 1991
- Checking computations in polylogarithmic timePublished by Association for Computing Machinery (ACM) ,1991
- Self-testing/correcting with applications to numerical problemsPublished by Association for Computing Machinery (ACM) ,1990
- Designing programs that check their workPublished by Association for Computing Machinery (ACM) ,1989
- How to recycle random bitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Multi-prover interactive proofs: how to remove intractabilityPublished by Association for Computing Machinery (ACM) ,1988
- Optimization, approximation, and complexity classesPublished by Association for Computing Machinery (ACM) ,1988