Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such proof systems -- interactive proofs, zero-knowledge proofs, and probabilistic checkable proofs -- stressing the essential role of randomness in each of them. This exposition is an expanded version of a survey written for the proceedings of the International Congress of Mathematicians (ICM94) held in Zurich in 1994. It is hope that this exposition may be accessible to a broad audience of computer scientists and mathematians
International audienceResearch on deductive verification of probabilistic programs has considered ex...
Probabilistic and logical reasoning are the cornerstones of many developments in artificial intellig...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...
Various types of probabilistic proof systems have played a central role in the de-velopment of compu...
Various types of probabilistic proof systems have played a central role in the development of comput...
Probabilistic programs [6] are sequential programs, written in languages like C, Java, Scala, or ML,...
This thesis addresses a question that emerges naturally from some observations about contemporary ma...
This book provides an overview of the theoretical underpinnings of modern probabilistic programming ...
International audienceRandomized algorithms are widely used for finding efficiently approximated sol...
We initiate the systematic study of probabilistic proofs in relativized worlds, where the goal is to...
AbstractThis volume contains the proceedings of the First International Workshop on Probabilistic Me...
Probabilistically Checkable Proofs (PCPs) allow a randomized verifier, with oracle access to a purpo...
AbstractExpectation-based probabilistic predicate transformers [15] provide a logic for probabilisti...
AbstractRandomized algorithms are widely used for finding efficiently approximated solutions to comp...
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, w...
International audienceResearch on deductive verification of probabilistic programs has considered ex...
Probabilistic and logical reasoning are the cornerstones of many developments in artificial intellig...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...
Various types of probabilistic proof systems have played a central role in the de-velopment of compu...
Various types of probabilistic proof systems have played a central role in the development of comput...
Probabilistic programs [6] are sequential programs, written in languages like C, Java, Scala, or ML,...
This thesis addresses a question that emerges naturally from some observations about contemporary ma...
This book provides an overview of the theoretical underpinnings of modern probabilistic programming ...
International audienceRandomized algorithms are widely used for finding efficiently approximated sol...
We initiate the systematic study of probabilistic proofs in relativized worlds, where the goal is to...
AbstractThis volume contains the proceedings of the First International Workshop on Probabilistic Me...
Probabilistically Checkable Proofs (PCPs) allow a randomized verifier, with oracle access to a purpo...
AbstractExpectation-based probabilistic predicate transformers [15] provide a logic for probabilisti...
AbstractRandomized algorithms are widely used for finding efficiently approximated solutions to comp...
We study the randomness complexity of interactive proofs and zero-knowledge proofs. In particular, w...
International audienceResearch on deductive verification of probabilistic programs has considered ex...
Probabilistic and logical reasoning are the cornerstones of many developments in artificial intellig...
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1995.Includes bibliogr...