Random Debaters and the Hardness of Approximating Stochastic Functions.

Anne Condon Joan Feigenbaum Carsten Lund Peter W. Shor

Published in: SIAM J. Comput. (1997)

Keyphrases

computational complexity
monte carlo
phase transition
learning theory
search engine
social networks
worst case
np complete
stochastic optimization
stochastic programming