PierreSenellart / descriptive-complexityView on GitHub
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
☆15Nov 3, 2026Updated this week

Alternatives and similar repositories for descriptive-complexity

Users that are interested in descriptive-complexity are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.

Sorting:

Are these results useful?