The complexity of the four colour theorem

DOI10.1112/S1461157009000461MaRDI QIDQ3092009zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• The four-colour theorem
• The Four Colour Theorem: Engineering of a Formal Proof
• scientific article; zbMATH DE number 1021588
• Formal proof - the four color theorem
• scientific article; zbMATH DE number 866017

Cites work

• Computing a Glimpse of Randomness
• scientific article; zbMATH DE number 1911266 (Why is no real title available?)

Cited in

(9)

• Inductive complexity measures for mathematical problems
• A program-size complexity measure for mathematical problems and conjectures
• The Four Colour Theorem: Engineering of a Formal Proof
• scientific article; zbMATH DE number 6930532 (Why is no real title available?)
• Inductive complexity of P versus NP problem (extended abstract)
• Formal proof - the four color theorem
• The complexity of Riemann's hypothesis
• Inductive complexity of the P versus NP problem
• The complexity of Euler's integer partition theorem

Describes a project that uses

Uses Software

• Coq

This page was built for publication: The complexity of the four colour theorem

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