<--- Back to Details
First PageDocument Content
Computational complexity theory / Theory of computation / Complexity classes / Randomized algorithms / Models of computation / IP / NP / ArthurMerlin protocol / Interactive proof system / BPP / PP / Zero-knowledge proof
Date: 2005-09-09 15:31:38
Computational complexity theory
Theory of computation
Complexity classes
Randomized algorithms
Models of computation
IP
NP
ArthurMerlin protocol
Interactive proof system
BPP
PP
Zero-knowledge proof

The KnowledgeComplexity of Interactive Proof-Systems (ExtendedAbstract) ShafiGoldwasser SilvioMicali CharlesRackoff MIT MIT Universityof Toronto

Add to Reading List

Source URL: groups.csail.mit.edu

Download Document from Source Website

File Size: 1,32 MB

Share Document on Facebook

Similar Documents

Abstract  The Theory and Practice of Causal Commutative Arrows Hai Liu 2011 Arrows are a popular form of abstract computation. Being more general than

Abstract The Theory and Practice of Causal Commutative Arrows Hai Liu 2011 Arrows are a popular form of abstract computation. Being more general than

DocID: 1xUZX - View Document

Semidefinite Programming Duality Implications for System Theory and Computation Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University  6 July, 2004

Semidefinite Programming Duality Implications for System Theory and Computation Venkataramanan (Ragu) Balakrishnan School of ECE, Purdue University 6 July, 2004

DocID: 1vqgc - View Document

Exploit Programming From Buffer Overflows to “Weird Machines” and Theory of Computation Se r g e y B r a t u s , M i c h a e l E . L o c a s t o , M e r e d i t h L . P a t t e r s o n , Le n S a s s a m a n , a n d

Exploit Programming From Buffer Overflows to “Weird Machines” and Theory of Computation Se r g e y B r a t u s , M i c h a e l E . L o c a s t o , M e r e d i t h L . P a t t e r s o n , Le n S a s s a m a n , a n d

DocID: 1uB7r - View Document

A THEORY OF THE LEARNABLE L.G. V a l i a n t Aiken Computation Laboratory Harvard University, Cambridge, Massachusetts  explicit programming.

A THEORY OF THE LEARNABLE L.G. V a l i a n t Aiken Computation Laboratory Harvard University, Cambridge, Massachusetts explicit programming.

DocID: 1uqLL - View Document

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

Introduction to higher-order computation Nordic Logic School, Stockholm, 2017 Mart´ın H¨otzel Escard´o Theory Group, School of Computer Science University of Birmingham, UK

DocID: 1ud4n - View Document