Curvature-based candidate construction plus explicit verification solves graph isomorphism correctly on all tested hard instances in deterministic polynomial time.
Milman.λ1 isoperimetric inequalities for graphs, and superconcentra- tors.Journal of Combinatorial Theory, Series B, 38(1):73–88
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.comp-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Finding Graph Isomorphisms in Heated Spaces in Almost No Time
Curvature-based candidate construction plus explicit verification solves graph isomorphism correctly on all tested hard instances in deterministic polynomial time.