The Complexity of Proving the Discrete Jordan Curve Theorem

DOI10.1145/2071368.2071377zbMATH Open1352.03068arXiv1002.2954OpenAlexW2171572930MaRDI QIDQ2946657

Author name not available (Why is that?)

Publication date: 17 September 2015

Published in: (Search for Journal in Brave)

Abstract: The Jordan Curve Theorem (JCT) states that a simple closed curve divides the plane into exactly two connected regions. We formalize and prove the theorem in the context of grid graphs, under different input settings, in theories of bounded arithmetic that correspond to small complexity classes. The theory $V^0(2)$ (corresponding to $A{C}^0(2)$) proves that any set of edges that form disjoint cycles divides the grid into at least two regions. The theory $V^0$ (corresponding to $A{C}^0$) proves that any sequence of edges that form a simple closed curve divides the grid into exactly two regions. As a consequence, the Hex tautologies and the st-connectivity tautologies have polynomial size $A{C}^0(2)$-Frege-proofs, which improves results of Buss which only apply to the stronger proof system $T{C}^0$-Frege.

Full work available at URL: https://arxiv.org/abs/1002.2954

zbMATH Keywords

No records found.

Mathematics Subject Classification ID

No records found.

This page was built for publication: The Complexity of Proving the Discrete Jordan Curve Theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946657)