## A Taxonomy of Proof Systems (1997)

Venue: | BASIC RESEARCH IN COMPUTER SCIENCE, CENTER OF THE DANISH NATIONAL RESEARCH FOUNDATION |

Citations: | 14 - 2 self |

### BibTeX

@INPROCEEDINGS{Goldreich97ataxonomy,

author = {Oded Goldreich},

title = {A Taxonomy of Proof Systems},

booktitle = {BASIC RESEARCH IN COMPUTER SCIENCE, CENTER OF THE DANISH NATIONAL RESEARCH FOUNDATION},

year = {1997},

pages = {109--134},

publisher = {Springer-Verlag}

}

### OpenURL

### Abstract

Several alternative formulations of the concept of an efficient proof system are nowadays coexisting in our field. These systems include the classical formulation of NP , interactive proof systems (giving rise to the class IP), computationally-sound proof systems, and probabilistically checkable proofs (PCP), which are closely related to multi-prover interactive proofs (MIP). Although these notions are sometimes introduced using the same generic phrases, they are actually very different in motivation, applications and expressive power. The main objective of this essay is to try to clarify these differences.