Back to Results
First PageMeta Content
Structural complexity theory / Complexity classes / Models of computation / Lance Fortnow / Probabilistic complexity theory / Interactive proof system / IP / Bounded-error probabilistic polynomial / Probabilistic Turing machine / Theoretical computer science / Computational complexity theory / Applied mathematics


Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139
Add to Reading List

Document Date: 2010-05-13 09:33:41

Open Document

File Size: 84,83 KB

Share Result on Facebook

City

New York / Cambridge / /

Facility

University of Chicago / Royal Institute of Tecnology / /

IndustryTerm

proof systems / interactive proof systems / /

Organization

MIT / Royal Institute of Tecnology / University of Chicago / Chicago / /

Person

Marek Karpinski / Eric Allender / /

ProvinceOrState

New York / Illinois / Massachusetts / /

PublishedMedium

the Theory of Computing / Journal of the ACM / /

URL

www.cs.uchicago.edu/~fortnow/papers / /

SocialTag