A deterministic O(n^6) algorithm for bipartite exact matching is obtained by proving the Affine-Slice Nonvanishing Theorem for all braces via induction on McCuaig's decomposition, with Lean 4 formalization.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Bipartite Exact Matching in P
A deterministic O(n^6) algorithm for bipartite exact matching is obtained by proving the Affine-Slice Nonvanishing Theorem for all braces via induction on McCuaig's decomposition, with Lean 4 formalization.