Login / Signup

If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances.

Dan GutfreundRonen ShaltielAmnon Ta-Shma
Published in: Comput. Complex. (2007)
Keyphrases
  • worst case
  • computational complexity
  • np hard
  • information retrieval
  • database systems
  • lower bound
  • information extraction
  • language independent
  • data model
  • special case
  • upper bound
  • error bounds