Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
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 cons
Add to Reading List
Document Date: 2001-10-24 10:54:49
Open Document
File Size: 383,06 KB
Share Result on Facebook
UPDATE
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 cons