<--- 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

Microsoft WordHunt CAD - Industrical BPP Industrial Rendition - blank for WEBSITE

Microsoft WordHunt CAD - Industrical BPP Industrial Rendition - blank for WEBSITE

DocID: 1uRWX - View Document

CS151 Complexity Theory Lecture 8 April 26, 2017  BPP

CS151 Complexity Theory Lecture 8 April 26, 2017 BPP

DocID: 1uNr4 - View Document

EVALUASI PENYULUHAN PERTANIAN ADAPTASI SPESIFIK LOKALITA DI BPP “INOVASI TEK JAGUNG DAN KEDELAI” Ekaningtyas Kushartanti BPTP Jawa Tengah Disampaikan pada :

EVALUASI PENYULUHAN PERTANIAN ADAPTASI SPESIFIK LOKALITA DI BPP “INOVASI TEK JAGUNG DAN KEDELAI” Ekaningtyas Kushartanti BPTP Jawa Tengah Disampaikan pada :

DocID: 1uLZ0 - View Document

Microsoft WordHunt CAD - BPP Rendition - blank for WEBSITE

Microsoft WordHunt CAD - BPP Rendition - blank for WEBSITE

DocID: 1uDhC - View Document

Microsoft Word - JWCAD BPP GuideNew Businesses only.doc

Microsoft Word - JWCAD BPP GuideNew Businesses only.doc

DocID: 1uzl0 - View Document