notes on things worth writing down.

P vs NP vs PSPACE: Understanding Computational Complexity

A walkthrough of P, NP, and PSPACE, how they relate, and why the idea of a witness connects NP problems to zero-knowledge proofs.