Curvature-based candidate construction plus explicit verification solves graph isomorphism correctly on all tested hard instances in deterministic polynomial time.
Consistency of fractional graph-laplacian regularization in semi-supervised learning with finite labels.SIAM Journal on Mathematical Analysis, 56(4)
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.