Hardness amplification within NP against deterministic algorithms.

Parikshit Gopalan Venkatesan Guruswami

Published in: J. Comput. Syst. Sci. (2011)

Keyphrases

computational complexity
np complete
np hard
phase transition
np hardness
learning theory
worst case
lower bound
neural network
hidden markov models
mobile robot
multiscale
clustering algorithm
computer vision
information retrieval
randomly generated
databases
fixed parameter tractable