![Lance Fortnow / Probabilistic complexity theory / BPP / Probabilistically checkable proof / Carsten Lund / Computational complexity theory Lance Fortnow / Probabilistic complexity theory / BPP / Probabilistically checkable proof / Carsten Lund / Computational complexity theory](https://www.pdfsearch.io/img/05855b1b393d63d78d48d42778f23685.jpg) Date: 2014-04-12 05:40:19Lance 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 ListSource URL: people.cs.uchicago.eduDownload Document from Source Website File Size: 71,64 KBShare Document on Facebook
|