This is a preview of subscription content, log in via an institution to check access.
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, Mass., 1974).
S.A. Cook, The complexity of theorem proving procedures, Proc. 3rd ACM Symposium on Theory of Computing, 1971, pp. 151–158.
J. Edmonds, Paths, trees and flowers, Canadian Journal of Mathematics 17(1965)449–467.
M.R. Garey and D.S. Johnson, Strong NP-completeness results: motivation, examples and implication, J. ACM 25, No. 4 (1978)499–508.
M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, 1979).
R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds.,Complexity of Computer Computation (Plenum Press, New York, 1972) pp. 85–104.
J.K. Lenstra, A.H.G. Rinnooy Kan and P. Brucker, Complexity of machine scheduling problems. Ann. Discrete Math. 1 (1977) pp. 343–362.
C.P. Schnorr, Satisfiability is quasilinear complete in NOL, J. ACM 25, No. 1 (1978)136–145.
Rights and permissions
About this article
Cite this article
The computational complexity of decision problems — Basic concepts. Ann Oper Res 7, 341–350 (1986). https://doi.org/10.1007/BF02186442
Issue Date:
DOI: https://doi.org/10.1007/BF02186442