TYPES '00 Selected papers from the International Workshop on Types for Proofs and Programs
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Formal global optimisation with taylor models
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving bounds for real linear programs in Isabelle/HOL
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
A Compiled Implementation of Normalization by Evaluation
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Flyspeck II: the basic linear programs
Annals of Mathematics and Artificial Intelligence
Certified exact real arithmetic using co-induction in arbitrary integer base
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Proof pearl: looping around the orbit
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Animating the formalised semantics of a Java-like language
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Verified efficient enumeration of plane graphs modulo isomorphism
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Formal global optimisation with taylor models
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Formalizing frankl's conjecture: FC-families
CICM'12 Proceedings of the 11th international conference on Intelligent Computer Mathematics
Communications of the ACM
| Hi-index | 0.02 |
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while reducing it from 5128 to 2771 graphs.