Related Terms
Algorithmic complexity; Program complexity
Computational complexity theory is a subdiscipline of computer science and mathematics that tries to classify computational problems and mathematical problems according to their difficulty. In this context, a computational problem or mathematical problem is understood to be a task that could be amenable to being solved by a computer (which means that the problem can be stated by a set of mathematical instructions).
Cross-References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media Dordrecht
About this entry
Cite this entry
Daniel, G.G. (2013). Computational Complexity. In: Runehov, A.L.C., Oviedo, L. (eds) Encyclopedia of Sciences and Religions. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-8265-8_200981
Download citation
DOI: https://doi.org/10.1007/978-1-4020-8265-8_200981
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-8264-1
Online ISBN: 978-1-4020-8265-8
eBook Packages: Humanities, Social Sciences and Law