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 the normal view instead:
scientific article; zbMATH DE number 7872058
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0 references
0.8452885150909424
0 references
0.8316836357116699
0 references
0.8122453689575195
0 references
0.8009995818138123
0 references
0.7610056400299072
0 references
