Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (Q2029005)
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: Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares |
scientific article |
Statements
Towards a computational proof of Vizing's conjecture using semidefinite programming and sums-of-squares (English)
0 references
3 June 2021
0 references
Vizing's conjecture
0 references
algebraic model
0 references
Gröbner basis
0 references
sum-of-squares problems
0 references
semidefinite programming
0 references
0 references
0 references
0.9500128626823424
0 references
0.9054332971572876
0 references
0.7971833944320679
0 references
