Back to Results
First PageMeta Content
Complexity 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 List

Document Date: 2008-05-08 17:50:59


Open Document

File Size: 251,91 KB

Share Result on Facebook
UPDATE