Topics in Combinatorial Optimization pp 87-95 | Cite as
Complexity of Combinatorial Computations
Chapter
Abstract
It is clear that there is no difficulty in solving virtually any combinatorial optimization problem in principle. None of the questions of insolvability, which are the central focus of recursive function theory, are an issue. If we wish to solve any given problem, all we need to do, in principle, is to make a list of all possible feasible solution, evaluate the cost of each one, and choose the best. This “solves” the problem at hand.
Preview
Unable to display preview. Download preview PDF.
References
- [1]R.V. Book, “On Languages Accepted in Polynomial Time,” SIAM J. Comput., 1 (1972) 281–287.MathSciNetMATHGoogle Scholar
- [2]S.A. Cook, “The Complexity of Theorem Proving Procedures,” Proc. Third ACM Symposium on Theory of Computing, (1971) 151–158.Google Scholar
- [3]S.A. Cook, “A Hierarchy of Nondeterministic Time Complexity,” Proc. Fourth ACM Symposium on Theory of Computing, (1972) 187–192.Google Scholar
- [4]K. Eswaran and R. Tarjan, “Minimal Augmentation of Graphs,” to appear in SIAM J. Comput.Google Scholar
- [5]R.M. Karp “Reducibility among Combinatorial Problems,” Proc, IBM Symposium on Complexity of Computer Computations, Plenum Press, N.Y., 1973.Google Scholar
- [6]E.L. Lawler, “An Introduction to Matroid Optimization,” this volume.Google Scholar
- [7]D. Matula, private communication, 1973.Google Scholar
Copyright information
© CISM, Udine 1975