Fast formal proof of the Erdős-Szekeres conjecture for convex polygons with at most 6 points (Q670696): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
Revision as of 02:03, 20 March 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
20 March 2019
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
