On Closeness of NP-Hard Sets to Other Complexity Classes.
Bin FuHong-Zhou LiPublished in: Computational Complexity Conference (1992)
Keyphrases
- np hard
- np hardness
- computational complexity
- worst case
- decision problems
- tractable cases
- lower bound
- optimal solution
- special case
- linear programming
- approximation algorithms
- space complexity
- complexity measures
- databases
- closely related
- branch and bound algorithm
- disjoint sets
- intrinsic complexity
- computational cost
- np complete
- positive and negative examples
- search space
- computationally challenging