Lean 4 Machine-Verified Proof of P
No mentions found
This entity hasn't been tracked yet, or Iris is still building its knowledge base.
Related Articles from SNS
Lean 4 Machine-Verified Proof of P = NP via the Pedigree Polytope Membership Problem
arXiv:2606.03194v1 Announce Type: new Abstract: The Membership Problem for Pedigree Polytope (M3P) asks, given $X\in\mathbb{Q}^{\binom{n}{3}}$, whether $X\in\mathrm{conv}(P_n)$, where $P_n$ is the set of all pedigrees. A pedigree is a structured encoding of a Hamiltonian cycle construction in $K_n$. We establish that M3P is solvable in strongly polynomial time via a recursively constructed layered network $(N_k, R_k, \mu)$ and a multicommodity flow problem MCF$(k)$. The necessary and...