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

First Page		Document Content
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 cons Add to Reading List Source URL: cs-www.cs.yale.edu Download Document from Source Website File Size: 383,06 KB Share Document on Facebook