Abstract
The authors introduce a new theorem-proving procedure, that is a new efficient method of communicating a proof. They then address the question of how much knowledge should be communicated for proving a theorem T.
Cite
CITATION STYLE
APA
Goldwasser, S., Micali, S., & Rackoff, C. (1985). KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF-SYSTEMS. In Conference Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 291–304). ACM (Order n 508850). https://doi.org/10.1145/22145.22178
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free