Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker (Q2945629): Difference between revisions

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+The challenge of computer mathematics
@@ Property / cites work: The challenge of computer mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Interactive theorem proving. 4th international conference, ITP 2013, Rennes, France, July 22--26, 2013. Proceedings
+Normal rank
@@ Property / cites work @@
+Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation
+Normal rank
@@ Property / cites work @@
+Sorting nine inputs requires twenty-five comparisons
+Normal rank
@@ Property / cites work @@
+Q5389068
@@ Property / cites work: Q5389068 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof
+Normal rank
@@ Property / cites work @@
+Q5675725
@@ Property / cites work: Q5675725 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302559
@@ Property / cites work: Q5302559 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+A SAT Attack on the Erdős Discrepancy Conjecture
@@ Property / cites work: A SAT Attack on the Erdős Discrepancy Conjecture / rank @@
+Normal rank
@@ Property / cites work @@
+A computer-assisted optimal depth lower bound for nine-input sorting networks
+Normal rank
@@ Property / cites work @@
+Formalizing Bounded Increase
@@ Property / cites work: Formalizing Bounded Increase / rank @@
+Normal rank
@@ Property / cites work @@
+Toward a Lower Bound for Sorting Networks
@@ Property / cites work: Toward a Lower Bound for Sorting Networks / rank @@
+Normal rank