Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-014-9798-x / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2083611171 / rank | |||
Normal rank | |||
Revision as of 00:00, 20 March 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
