
06655908
j
2016f.01349
Nasar, Audrey A.
The history of algorithmic complexity.
Math. Enthus. 13, No. 3, 217242 (2016).
2016
Information Age Publishing (IAP), Charlotte, NC; University of Montana, Department of Mathematical Sciences, Missoula, MT
EN
P20
A30
algorithmic complexity
history of mathematics
algorithms
theory of complexity
discrete mathematics
NPcompleteness
computational complexity
http://scholarworks.umt.edu/tme/vol13/iss3/4
Summary: This paper provides a historical account of the development of algorithmic complexity in a form that is suitable to instructors of mathematics at the high school or undergraduate level. The study of algorithmic complexity, despite being deeply rooted in mathematics, is usually restricted to the computer science curriculum. By providing a historical account of algorithmic complexity through a mathematical lens, this paper aims to equip mathematics educators with the necessary background and framework for incorporating the analysis of algorithmic complexity into mathematics courses as early on as algebra or precalculus.