← back to home

Computational Complexity

I will be sharing my notes on the theorems and proofs I found most interesting from the complexity class. This is a non-exhaustive list, and I hope to continue adding more notes from time to time.

Chapter 1: Time-Bound Complexity

  1. PRIMES is in NP
  2. Next: Cook-Levin Theorem.