Flyspeck I: Tame Graphs
From MaRDI portal
Publication:3613398
DOI10.1007/11814771_4zbMath1222.52018OpenAlexW1602296319MaRDI QIDQ3613398
Tobias Nipkow, Gertrud Bauer, Paula Schultz
Publication date: 12 March 2009
Published in: Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11814771_4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (15)
A FORMAL PROOF OF THE KEPLER CONJECTURE ⋮ Verifying Faradžev-Read Type Isomorph-Free Exhaustive Generation ⋮ Formalizing Frankl’s Conjecture: FC-Families ⋮ Flyspeck II: The basic linear programs ⋮ A compiled implementation of normalisation by evaluation ⋮ Computational logic: its origins and applications ⋮ Introduction to ``Milestones in interactive theorem proving ⋮ Graph theory in Coq: minors, treewidth, and isomorphisms ⋮ The Isabelle Framework ⋮ A Compiled Implementation of Normalization by Evaluation ⋮ The dodecahedral conjecture ⋮ A revision of the proof of the Kepler conjecture ⋮ A graph library for Isabelle ⋮ Verified Efficient Enumeration of Plane Graphs Modulo Isomorphism ⋮ Tame Graphs
Uses Software
This page was built for publication: Flyspeck I: Tame Graphs
