<--- Back to Details
First PageDocument Content
Lance Fortnow / Probabilistic complexity theory / BPP / Probabilistically checkable proof / Carsten Lund / Computational complexity theory
Date: 2014-04-12 05:40:19
Lance Fortnow
Probabilistic complexity theory
BPP
Probabilistically checkable proof
Carsten Lund
Computational complexity theory

Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192.

Add to Reading List

Source URL: people.cs.uchicago.edu

Download Document from Source Website

File Size: 71,64 KB

Share Document on Facebook

Similar Documents