← Back to Learn

Complexity Classes

Interactive map of P, NP, NP-complete, PSPACE, and EXPTIME. Click problems to learn about their classification.

EXPTIMEPSPACENPPNP-hardNP-completeShortest PathSortingMax FlowLinear ProgrammingMSTMatching2-SATSAT (3-SAT)TSP (decision)0-1 KnapsackGraph ColoringBin PackingSubset SumVertex CoverHamiltonian PathTSP (optimization)Halting ProblemQBFGeneralized ChessGeneralized GoGeneralized Checkers

Click a problem dot to see details

filter by class
P ⊆ NP ⊆ PSPACE ⊆ EXPTIME
Whether P = NP is the biggest open question in CS.

© 2026 Dantzig. Optimisation made accessible.

Powered by HiGHS