March 2023
Intermediate to advanced
680 pages
13h 44m
English
An algorithm is a finite answer to an infinite number of questions — Stephen Kleene
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
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 brief introduction to computational complexity, we will focus mainly on the concepts involved in estimating how much time ...
Read now
Unlock full access