Pages that link to "Item:Q5963658"
From MaRDI portal
The following pages link to Connection between a class of polynomial optimization problems and maximum cliques of non-uniform hypergraphs (Q5963658):
Displaying 8 items.
- The connection between polynomial optimization, maximum cliques and Turán densities (Q528562) (← links)
- Connection between polynomial optimization and maximum cliques of non-uniform hypergraphs (Q722592) (← links)
- A generalization of the Motzkin-Straus theorem to hypergraphs (Q1024737) (← links)
- Maximum cliques of hypergraphs and polynomial optimization (Q1617049) (← links)
- A homogeneous polynomial associated with general hypergraphs and its applications (Q2174504) (← links)
- Connection between continuous optimization and Turán densities of non-uniform hypergraphs (Q2240668) (← links)
- HOMOGENEOUS MULTILINEAR FUNCTIONS ON HYPERGRAPH CLIQUES (Q5357952) (← links)
- A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)