olemus
kombinatoorikaülesande lahendamiseks kuluv vähim arvutussammude arv mingis arvutusmudelis, tavaliselt Turingi masina mudelis
= minimum number of computational steps required to solve a combinatorial problem in a given model

ülevaateid
https://www.techopedia.com/definition/22573/time-complexity

https://en.wikipedia.org/wiki/Time_complexity

http://www.engr.mun.ca/~theo/Courses/AlgCoCo/6892-downloads/alg-co-co-notes-120-more-complexity.pdf

http://www.uni-forst.gwdg.de/~wkurth/cb/html/cs1_v06.pdf

https://www.studytonight.com/data-structures/time-complexity-of-algorithms

https://adrianmejia.com/most-popular-algorithms-time-complexity-every-programmer-should-know-free-online-tutorial-course/

http://www.iitk.ac.in/esc101/2009Jan/lecturenotes/timecomplexity/TimeComplexity_using_Big_O.pdf

vt ka
- algoritmiline keerukus
- keerukus
- keerukusteooria
- Kolmogorovi keerukus
- mahuline keerukus
- pääsu keerukus
- pöörduse keerukus