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?”
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. Cobham, “The intrinsic computational difficulty of functions,” Proc. Logic, Methodology, and Philosophy of Science II, North Holland, 1965.
D. Kozen, Theory of computation. Birkhäuser, 2006.
S. Arora and B. Barak, Computational Complexity: A Modern Approach. New York, NY, USA: Cambridge University Press, 1st ed., 2009.
D. Huffman, “A method for the construction of minimum-redundancy codes,” Proceedings of the IRE, vol. 40, pp. 1098–1101, 1952.
J. Łukasiewicz, Aristotle’s Syllogistic from the Standpoint of Modern Formal Logic. Oxford University Press, 1957.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Neri, F. (2019). An Introduction to Computational Complexity. In: Linear Algebra for Computational Sciences and Engineering. Springer, Cham. https://doi.org/10.1007/978-3-030-21321-3_11
Download citation
DOI: https://doi.org/10.1007/978-3-030-21321-3_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-21320-6
Online ISBN: 978-3-030-21321-3
eBook Packages: Computer ScienceComputer Science (R0)