Proof of concept for "TSP Escapes the O(2^n n^2) Curse" -- First improvement after more than 60 years
-
Updated
Jun 7, 2024 - Jupyter Notebook
#
polynomial-method
Here are 2 public repositories matching this topic...
Lean 4 proof of the higher-dimensional Erdős distinct-distances bound (Erdos distinct distances): n points in R^d, d ≥ 3, determine at least c_d n^(2/d) distinct distances, and this order is sharp; formalization with Mathlib
theorem-proving lean formal-verification discrete-geometry mathlib lean4 polynomial-method formal-proof erdos-problems combinatorial-geometry
-
Updated
Oct 15, 2026 - Lean
Add this topic to your repo
To associate your repository with the polynomial-method topic, visit your repo's landing page and select "manage topics."