CSE 312
Foundations of Computing II
Examines fundamentals of enumeration and discrete probability; applications of randomness to computing; polynomial-time versus NP; and NP-completeness. Prerequisite: CSE 311.
Sources
- Course catalogue ↗Current public catalogue; retrieved 2026-11-05