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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099329863 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.05209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: The challenge of computer mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive theorem proving. 4th international conference, ITP 2013, Rennes, France, July 22--26, 2013. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight Proof by Reflection Using a Posteriori Simulation of Effectful Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting nine inputs requires twenty-five comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5389068 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Attack on the Erdős Discrepancy Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computer-assisted optimal depth lower bound for nine-input sorting networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalizing Bounded Increase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Lower Bound for Sorting Networks / rank
 
Normal rank

Latest revision as of 19:01, 10 July 2024

scientific article
Language Label Description Also known as
English
Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker
scientific article

    Statements

    Formalizing Size-Optimal Sorting Networks: Extracting a Certified Proof Checker (English)
    0 references
    0 references
    0 references
    14 September 2015
    0 references
    0 references
    0 references
    0 references