Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs (Q722592)
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: Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs |
scientific article; zbMATH DE number 6911230
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs |
scientific article; zbMATH DE number 6911230 |
Statements
Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs (English)
0 references
27 July 2018
0 references
maximum clique
0 references
polynomial optimization
0 references
Turán density
0 references
0 references
0 references
0.9664637446403505
0 references
0.9547885060310364
0 references
0.9410610198974608
0 references
0.8741047382354736
0 references
0.8706090450286865
0 references
