np-complete-problems repositories
Trending repositories tagged np-complete-problems, ranked by trending score. Updated daily.
-
1
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
GitHub · Lean · 17 stars · 3 forks · +2 stars in 24 hours · Trending score 0.80