Login / Signup
Random Debaters and the Hardness of Approximating Stochastic Functions.
Anne Condon
Joan Feigenbaum
Carsten Lund
Peter W. Shor
Published in:
Computational Complexity Conference (1994)
Keyphrases
</>
np complete
monte carlo
stochastic programming
artificial intelligence
image segmentation
multiscale
objective function
computational complexity
basis functions
learning theory
stochastic model
stochastic optimization
stochastic models