<--- 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

Microsoft WordHunt CAD - Industrical BPP Industrial Rendition - blank for WEBSITE

Microsoft WordHunt CAD - Industrical BPP Industrial Rendition - blank for WEBSITE

DocID: 1uRWX - View Document

CS151 Complexity Theory Lecture 8 April 26, 2017  BPP

CS151 Complexity Theory Lecture 8 April 26, 2017 BPP

DocID: 1uNr4 - View Document

EVALUASI PENYULUHAN PERTANIAN ADAPTASI SPESIFIK LOKALITA DI BPP “INOVASI TEK JAGUNG DAN KEDELAI” Ekaningtyas Kushartanti BPTP Jawa Tengah Disampaikan pada :

EVALUASI PENYULUHAN PERTANIAN ADAPTASI SPESIFIK LOKALITA DI BPP “INOVASI TEK JAGUNG DAN KEDELAI” Ekaningtyas Kushartanti BPTP Jawa Tengah Disampaikan pada :

DocID: 1uLZ0 - View Document

Microsoft WordHunt CAD - BPP Rendition - blank for WEBSITE

Microsoft WordHunt CAD - BPP Rendition - blank for WEBSITE

DocID: 1uDhC - View Document

Microsoft Word - JWCAD BPP GuideNew Businesses only.doc

Microsoft Word - JWCAD BPP GuideNew Businesses only.doc

DocID: 1uzl0 - View Document