Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(10 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DRAT-trim / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Isabelle/Isar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HOL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: HOL Light / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q123335389 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-017-9423-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2753309515 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compiled Implementation of Normalization by Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretation of Locales in Isabelle: Theories and Proof Contexts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Convex Polygons Determined by a Finite Planar Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5759552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 30 years of research and development around Coq / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient verified (UN)SAT certificate checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formalization and implementation of modern SAT solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal verification of a modern SAT solver by shallow embedding into Isabelle/HOL / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6173578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdos-Szekeres problem on points in convex position – a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Szekeres Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790670 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mechanical Verification of a DPLL-Based Satisfiability Solver / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős-Szekeres convex polygon problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer solution to the 17-point Erdős-Szekeres problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs / rank
 
Normal rank

Latest revision as of 20:23, 18 July 2024

scientific article
Language Label Description Also known as
English
Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points
scientific article

    Statements

    Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (English)
    0 references
    0 references
    20 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Erdős-Szekeres conjecture
    0 references
    happy ending problem
    0 references
    convex polygons
    0 references
    interactive theorem proving
    0 references
    SAT-solving
    0 references
    Isabelle/HOL
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references