Computational Complexity and Knowledge Complexity
- 1 August 1998
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 27 (4), 1116-1141
- https://doi.org/10.1137/s0097539795280524
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Quantifying knowledge complexitycomputational complexity, 1999
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systemsJournal of the ACM, 1991
- The Effect of Computerized Tests on the Performance and Attitudes of College StudentsJournal of Educational Computing Research, 1989
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Does co-NP have short interactive proofs?Information Processing Letters, 1987
- Random generation of combinatorial structures from a uniform distributionTheoretical Computer Science, 1986