Curvature-based candidate construction plus explicit verification solves graph isomorphism correctly on all tested hard instances in deterministic polynomial time.
Algebraic connectivity of graphs.Czechoslovak Mathematical Journal, 23(2):298–305
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
ReLU activation patterns create polytope decompositions whose dual graph Fiedler partitions correlate with decision boundaries, and cell counts track training loss.
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.
-
Topological Signatures of ReLU Neural Network Activation Patterns
ReLU activation patterns create polytope decompositions whose dual graph Fiedler partitions correlate with decision boundaries, and cell counts track training loss.