The complexity of the four colour theorem
From MaRDI portal
Publication:3092009
DOI10.1112/S1461157009000461zbMath1235.03071OpenAlexW2077797656MaRDI QIDQ3092009
Elena Calude, Cristian S. Calude
Publication date: 15 September 2011
Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s1461157009000461
Number-theoretic algorithms; complexity (11Y16) Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A Program-Size Complexity Measure for Mathematical Problems and Conjectures ⋮ Inductive Complexity of P versus NP Problem ⋮ INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM ⋮ The complexity of Euler's integer partition theorem ⋮ INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS
Uses Software
Cites Work