![](https://www.pdfsearch.io/img/c13ac9467be833af55e67252f68587c2.jpg) Date: 2001-10-24 10:54:49
| | RANDOM DEBATERS AND THE HARDNESS OF APPROXIMATING STOCHASTIC FUNCTIONS ANNE CONDONy , JOAN FEIGENBAUMz , CARSTEN LUNDx , AND PETER SHOR{ Abstract. A probabilistically checkable debate system (PCDS) for a language L consAdd to Reading ListSource URL: cs-www.cs.yale.eduDownload Document from Source Website File Size: 383,06 KBShare Document on Facebook
|