Login / Signup
Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis.
Debasis Mandal
Aduri Pavan
Rajeswari Venugopalan
Published in:
Electron. Colloquium Comput. Complex. (2014)
Keyphrases
</>
worst case
np hard
data quality
greedy algorithm
information theoretic
upper bound
information retrieval
computational complexity
data sets
lower bound
video sequences
objective function
case study
space complexity
average case
worst case analysis
formal proofs