NP-Hard Sets Are Exponentially Dense Unless coNP C NP/poly.

Harry Buhrman John M. Hitchcock

Published in: Computational Complexity Conference (2008)

Keyphrases

np hard
decision problems
np complete
computational complexity
worst case
optimal solution

approximation algorithms
special case
scheduling problem
linear programming
integer programming
closely related

np hardness
conjunctive queries
minimum cost
knapsack problem
constraint satisfaction problems
greedy heuristic

data sets
optical flow fields
lower bound
search algorithm
reinforcement learning