Closeness of NP-Hard Sets to Other Complexity Classes.
Bin FuHong-Zhou LiPublished in: SIAM J. Comput. (1994)
Keyphrases
- np hard
- worst case
- np hardness
- computational complexity
- tractable cases
- decision problems
- linear programming
- lower bound
- scheduling problem
- closely related
- approximation algorithms
- computational cost
- special case
- integer programming
- complexity measures
- intrinsic complexity
- information systems
- knapsack problem
- complexity analysis
- optimal solution
- training data