Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658): Difference between revisions
From MaRDI portal
Latest revision as of 12:03, 11 July 2024
scientific article; zbMATH DE number 6544346
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
