July 2025
Beginner to intermediate
512 pages
11h 48m
English
The art of simplicity is a puzzle of complexity — Douglas Horton
Computational complexity theory is the branch of theoretical computer science that is concerned with quantifying the resources needed to solve problems with algorithms. It asks questions such as “How much time is needed to multiply two integer numbers of n bits each?”, “Do you need more memory space to solve a problem than to check its solution?”, or “Is randomness useful in computational tasks?”.
In this appendix, we will focus mainly on the mathematical techniques involved in estimating how much time is required to solve certain problems. For a thorough treatment of this and other topics (including space or memory complexity, ...
Read now
Unlock full access