GitHub · Lean
PierreSenellart/descriptive-complexity
A Lean library for descriptive complexity: NP-completeness and the polynomial hierarchy by first-order reductions, stronger than polynomial-time (Karp) reductions. Machine-free Cook–Levin, all 21 Karp problems, on Mathlib's ModelTheory
- Stars
- 17
- Forks
- 3
- Stars gained in 24 hours
- +2
- Forks gained in 24 hours
- 0
Topics: complexity, cook-levin, descriptive-complexity, lean, lean4, model-theory, np-complete, np-complete-problems, np-completeness, polynomial-time-reductions
Latest data point: Nov 22, 2026 · 17 stars · 3 forks