Limitations of Hardness vs. Randomness under Uniform Reductions.

Dan Gutfreund Salil P. Vadhan

Published in: APPROX-RANDOM (2008)

Keyphrases

efficient computation
information theoretic
learning theory
random number
decision making
case study
search algorithm
databases
np complete
np hard
agnostic learning
np hardness
phase transition
multiresolution
computational complexity
search engine
information retrieval