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:
CSR (2013)
Keyphrases
</>
worst case
lower bound
np hard
computational complexity
expressive power
hard problems
information retrieval
information systems
website
text classification
language identification