Abstract
This paper introduces a geometric representation that can be applied to illustrate the complexity of some combinatorial optimization problems. In this work, it is applied to the 0/1 knapsack problem and to a special case of a scheduling problem. This representation gives insight into the difference between tractable and intractable problems. It can therefore be used as a stepping stone to compare polynomial (P) and nondeterministic polynomial (NP) problems, before venturing into the world of NP-completeness.
- ACM68 ACM Curriculum Committee on Computer Science. Curriculum 68: Recommendations for academic programs in computer science. Communications of the ACM, I 1 (3): 151-197, 1968. Google Scholar
Digital Library
- ACM79 ACM Curriculum Committee on Computer Science. Curriculum 78: Recommendations for the undergraduate program in computer science. Communications of the ACM, 22(3):147-166, 1979. Google Scholar
Digital Library
- GT86 N. Gibbs and A. Tucker. A model corriculum for a liberal arts degree in computer science. Communications of the ACM, 29(3):202-210, 1986. Google Scholar
Digital Library
- Kar72 R.M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computation, pages 85-103. Plenum, New York, 1972.Google Scholar
Cross Ref
- MT90 S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Chichester, West Sussex, England, 1990. Google Scholar
Digital Library
- PS82 C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall, Inc., Englewood Cliffs, New Jersey, 1982. Google Scholar
Digital Library
- Sti87 D.R. Stinson. An Introduction to the Design and Analysis of Algorithms. The Charles Babbage Research Center, Winnipeg, Manitoba, Canada, 2nd edition, 1987.Google Scholar
- Tur91 A.J. Turner. Introduction to the joint curriculum task force report. Communications of the ACM, 34(6):69-79,1991.Google Scholar
Index Terms
Intractability: a geometric representation
Recommendations
Average-case intractability vs. worst-case intractability
We show that not all sets in NP (or other levels of the polynomial-time hierarchy) have efficient average-case algorithms unless the Arthur-Merlin classes MA and AM can be derandomized to NP and various subclasses of P/poly collapse to P. Furthermore, ...
Intractability of Clique-Width Parameterizations
We show that Edge Dominating Set, Hamiltonian Cycle, and Graph Coloring are $W[1]$-hard parameterized by clique-width. It was an open problem, explicitly mentioned in several papers, whether any of these problems is fixed parameter tractable when ...






Comments