Zusammenfassung
Wann ist ein Problem schwer? Warum ist ein Problem schwerer als ein anderes? Mit diesen Fragen befasst sich die Komplexitätstheorie. In Abschnitt 3.4 wurden ausgewählte Graphenprobleme vorgestellt, wie zum Beispiel das Färbbarkeitsproblem für Graphen, und es wurde erwähnt, dass alle diese Probleme „schwer“ sind. Was darunter zu verstehen ist, wird Inhalt dieses Kapitels sein.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Stearns. Juris Hartmanis: The beginnings of computational complexity. In A. Selman, editor, Complexity Theory Retrospective, pages 1–18. Springer-Verlag, 1990.
L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1–22, 1977.
J. Rothe. Komplexitätstheorie und Kryptologie. Eine Einführung in Kryptokomplexität. eXamen.Press. Springer-Verlag, 2008.
J. Flum and M. Grohe. Parameterized Complexity Theory. EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2006.
J. Edmonds. Paths, trees and flowers. Canadian Journal of Mathematics, 17:449–467, 1965.
L. Levin. Universal sorting problems. Problemy Peredaci Informacii, 9:115–116, 1973. In Russian. English translation in Problems of Information Transmission, 9:265–266, 1973.
R. Downey and M. Fellows. Parameterized Complexity. Springer-Verlag, 1999.
A. Cobham. The intrinsic computational difficulty of functions. In Proceedings of the 1964 International Congress for Logic Methodology and Philosophy of Science, pages 24–30. North Holland, 1964.
R. Karp. Reducibilities among combinatorial problems. In R. Miller and J. Thatcher, editors, Complexity of Computer Computations, pages 85–103, 1972.
S. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM Symposium on Theory of Computing, pages 151–158. ACM Press, 1971.
K. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53–80, 1987.
C. Wrathall. Complete sets and the polynomial-time hierarchy. Theoretical Computer Science, 3:23–33, 1977.
C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
L. Stockmeyer. Planar 3-colorability is NP-complete. SIGACT News, 5(3):19–25, 1973.
D. Bovet and P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993.
M. Schaefer and C. Umans. Completeness in the polynomial-time hierarchy: PartI: A compendium. SIGACT News, 33(3):32–49, September 2002.
R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
W. Savitch. Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences, 4(2):177–192, 1970.
A. Rosenberg. Real-time definable languages. Journal of the ACM, 14:645–662, 1967.
C. Papadimitriou. On the complexity of unique solutions. Journal of the ACM, 31(2):392–400, 1984.
A. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, pages 125–129. IEEE Computer Society Press, October 1972.
T. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216–226. ACM Press, May 1978.
J. Hartmanis, P. Lewis, and R. Stearns. Classification of computations by time and memory requirements. In Proceedings of the IFIP World Computer Congress 65, pages 31–35. International Federation for Information Processing, Spartan Books, 1965.
J. Hartmanis and R. Stearns. On the computational complexity of algorithms. Transactions of the American Mathematical Society, 117:285–306, 1965.
K. Appel and W. Haken. Every planar map is 4-colorable – 1: Discharging. Illinois J. Math, 21:429–490, 1977.
S. Khuller and V. Vazirani. Planar graph coloring is not self-reducible, assuming \({\textrm{p}} \neq {\textrm{np}}\). Theoretical Computer Science, 88(1):183–189, 1991.
J. Rothe. Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science. Springer-Verlag, 2005.
R. Downey and M. Fellows. Fixed parameter tractability and completeness. Congressus Numerantium, 87:161–187, 1992.
R. Stearns, J. Hartmanis, and P. Lewis. Hierarchies of memory limited computations. In Proceedings of the 6th IEEE Symposium on Switching Circuit Theory and Logical Design, pages 179–190. IEEE Computer Society Press, October 1965.
P. Lewis, R. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. In Proceedings of the 6th IEEE Symposium on Switching Circuit Theory and Logical Design, pages 191–202. IEEE Computer Society Press, October 1965.
M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
C. Umans. The minimum equivalent DNF problem and shortest implicants. Journal of Computer and System Sciences, 63(4):597–611, 2001.
M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490–509, 1988.
J. Balcázar, J.Díaz, and J. Gabarró. Structural Complexity II. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1990.
J. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1995.
A. Groβe, J. Rothe, and G. Wechsung. On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Information Processing Letters, 99(6):215–221, 2006.
R. Downey and M. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24(4):873–921, 1995.
R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. Karp, editor, Complexity of Computation, volume7, pages 43–73. Proceedings of the SIAM-AMS Symposium in Applied Mathematics, 1974.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gurski, F., Rothe, I., Rothe, J., Wanke, E. (2010). Komplexitätstheorie. In: Exakte Algorithmen für schwere Graphenprobleme. eXamen.press. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04500-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-04500-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04499-1
Online ISBN: 978-3-642-04500-4
eBook Packages: Computer Science and Engineering (German Language)