Login / Signup
Improving on Gutfreund, Shaltiel, and Ta-Shma's paper "If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances".
Nikolay K. Vereshchagin
Published in:
Electron. Colloquium Comput. Complex. (2011)
Keyphrases
</>
worst case
lower bound
real time
machine learning
upper bound
database
databases
computational complexity
evolutionary algorithm
natural language processing
error bounds