Automata, Computability and Complexity: Theory & Applications

Strassen’s Algorithm

Seven Bridges of Königsberg

Minimum Spanning Trees

Prime Numbers and Primality Testing

Shor’s Algorithm and Quantum Computing

Boolean Satisfiability

Does P = NP?

NP-Complete Problems

Shortest Path Problem

Map coloring

Linear Programming