The Knowledge Complexity of Interactive Proof Systems.Proofs that Release Minimum Knowledge.Randomness, Interactive Proofs, and Zero-Knowledge--A Survey [Book Review]

Journal of Symbolic Logic 56 (3):1092 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,758

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Some remarks on lengths of propositional proofs.Samuel R. Buss - 1995 - Archive for Mathematical Logic 34 (6):377-394.
The surveyability of long proofs.Edwin Coleman - 2009 - Foundations of Science 14 (1-2):27-43.
The Depth of Resolution Proofs.Alasdair Urquhart - 2011 - Studia Logica 99 (1-3):349-364.
Interactive and probabilistic proof-checking.Luca Trevisan - 2000 - Annals of Pure and Applied Logic 104 (1-3):325-342.
Non-circular proofs and proof realization in modal logic.Ren-June Wang - 2014 - Annals of Pure and Applied Logic 165 (7-8):1318-1338.
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.
Propositional consistency proofs.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 52 (1-2):3-29.
Knowledge condition games.Sieuwert van Otterloo, Wiebe Van Der Hoek & Michael Wooldridge - 2006 - Journal of Logic, Language and Information 15 (4):425-452.
Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.

Analytics

Added to PP
2010-09-12

Downloads
57 (#286,967)

6 months
9 (#351,255)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references