Computational complexity (P vs NP)

Layer 0 — Mathematicsin the recursion-theory subtree

Cook-Levin 1971 NP-completeness. Major open: P vs NP. Karp 1972 21 NP-complete problems. Foundational. Bridges recursion + algorithm-design + L0 graph-theory.

Related concepts

Boolean algebra

Explore Computational complexity (P vs NP) on the interactive knowledge graph →