First Page | Document Content | |
---|---|---|
Date: 2005-09-09 15:31:38Computational 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 TorontoAdd to Reading ListSource URL: groups.csail.mit.eduDownload Document from Source WebsiteFile Size: 1,32 MBShare Document on Facebook |