Skip to main content
Top

2019 | OriginalPaper | Chapter

11. An Introduction to Computational Complexity

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This chapter is not strictly about algebra. However, this chapter offers a set of mathematical and computational instruments that will allow us to introduce several concepts in the following chapters. Moreover, the contents of this chapter are related to algebra as they are ancillary concepts that help (and in some cases allow) the understanding of algebra. More specifically, this chapter gives some basics of complexity theory and discrete mathematics and will attempt to answer to the question: “What is a hard problem?”

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
21.
go back to reference A. Cobham, “The intrinsic computational difficulty of functions,” Proc. Logic, Methodology, and Philosophy of Science II, North Holland, 1965. A. Cobham, “The intrinsic computational difficulty of functions,” Proc. Logic, Methodology, and Philosophy of Science II, North Holland, 1965.
22.
go back to reference D. Kozen, Theory of computation. Birkhäuser, 2006. D. Kozen, Theory of computation. Birkhäuser, 2006.
23.
go back to reference S. Arora and B. Barak, Computational Complexity: A Modern Approach. New York, NY, USA: Cambridge University Press, 1st ed., 2009. S. Arora and B. Barak, Computational Complexity: A Modern Approach. New York, NY, USA: Cambridge University Press, 1st ed., 2009.
24.
go back to reference D. Huffman, “A method for the construction of minimum-redundancy codes,” Proceedings of the IRE, vol. 40, pp. 1098–1101, 1952.CrossRef D. Huffman, “A method for the construction of minimum-redundancy codes,” Proceedings of the IRE, vol. 40, pp. 1098–1101, 1952.CrossRef
25.
go back to reference J. Łukasiewicz, Aristotle’s Syllogistic from the Standpoint of Modern Formal Logic. Oxford University Press, 1957.MATH J. Łukasiewicz, Aristotle’s Syllogistic from the Standpoint of Modern Formal Logic. Oxford University Press, 1957.MATH
Metadata
Title
An Introduction to Computational Complexity
Author
Ferrante Neri
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-030-21321-3_11

Premium Partner