Perfect matching in random graphs is as hard as Tseitin (Q6562700)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Perfect matching in random graphs is as hard as Tseitin |
scientific article; zbMATH DE number 7872058
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Perfect matching in random graphs is as hard as Tseitin |
scientific article; zbMATH DE number 7872058 |
Statements
Perfect matching in random graphs is as hard as Tseitin (English)
0 references
27 June 2024
0 references
proof complexity
0 references
perfect matching
0 references
topological embedding
0 references
sum of squares
0 references
polynomial calculus
0 references
bounded-depth Frege
0 references
0 references
