Abstract
The complexity of some decision support problems are explored with several examples of exponential growth. The chapter discusses different forms of “generate-and-test” search, as a basis for fomalising computational complexity. A number of complexity classes are described, with illustrations of their growth with the number and size of their parameters. Finally the fundamental question of P = NP? is presented, leading into a definition of NP-completeness.
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
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Wallace, M. (2020). Algorithms and Complexity. In: Building Decision Support Systems. Springer, Cham. https://doi.org/10.1007/978-3-030-41732-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-030-41732-1_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-41731-4
Online ISBN: 978-3-030-41732-1
eBook Packages: Computer ScienceComputer Science (R0)