![Complexity classes / Computational complexity theory / Advice / PP / P/poly / ArthurMerlin protocol / Pseudorandom generator / Randomized algorithm / NP / IP / Extractor / ACC0 Complexity classes / Computational complexity theory / Advice / PP / P/poly / ArthurMerlin protocol / Pseudorandom generator / Randomized algorithm / NP / IP / Extractor / ACC0](https://www.pdfsearch.io/img/bcd8a0637e5bfb0022f14d342d880630.jpg) Date: 2008-05-08 17:50:59Complexity classes Computational complexity theory Advice PP P/poly ArthurMerlin protocol Pseudorandom generator Randomized algorithm NP IP Extractor ACC0 | | Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125.Add to Reading ListSource URL: users.cms.caltech.eduDownload Document from Source Website File Size: 251,91 KBShare Document on Facebook
|