Login / Signup
Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis.
Debasis Mandal
Aduri Pavan
Rajeswari Venugopalan
Published in:
FSTTCS (2014)
Keyphrases
</>
worst case
upper bound
data quality
computational complexity
information retrieval
learning theory
lower bound
np hard
mobile robot
worst case analysis
average case
greedy algorithm
error bounds
data mining
multi agent
decision making
computer vision
machine learning