Theoretical Computer Science
Algorithms, complexity, computation, and the mathematical foundations of computing.
Foundational CS theory — what can be computed, how efficiently, and why. Browse the subtopics below.
Subtopics
Notes
- Data Compression and Source Coding Kraft inequality, Huffman codes, and Shannon-Fano-Elias coding bounds.
- Kolmogorov Complexity Incompressible sequences, Occam's Razor, and the Minimum Description Length principle.
- Universal Source Coding Arithmetic coding, Lempel-Ziv algorithms, and optimality proofs.