Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658)
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 a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs |
scientific article; zbMATH DE number 6544346
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs |
scientific article; zbMATH DE number 6544346 |
Statements
Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (English)
0 references
23 February 2016
0 references
hypergraph
0 references
maximum clique
0 references
polynomial optimization
0 references
0 references
0 references
0.9664637446403505
0 references
0.9435511231422424
0 references
0.9290635585784912
0 references
0.8815863728523254
0 references
0.8562259078025818
0 references
