Graph colouring is hard for algorithms based on Hilbert's Nullstellensatz and Gröbner bases (Q5111132)
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 7204253
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph colouring is hard for algorithms based on Hilbert's Nullstellensatz and Gröbner bases |
scientific article; zbMATH DE number 7204253 |
Statements
26 May 2020
0 references
proof complexity
0 references
Nullstellensatz
0 references
Gröbner basis
0 references
polynomial calculus
0 references
cutting planes
0 references
3-colouring
0 references
0.8737707138061523
0 references
0.8522694706916809
0 references
0.827129065990448
0 references
0.8266475200653076
0 references
