On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6575180)
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: On the complexity of binary polynomial optimization over acyclic hypergraphs |
scientific article; zbMATH DE number 7883686
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of binary polynomial optimization over acyclic hypergraphs |
scientific article; zbMATH DE number 7883686 |
Statements
On the complexity of binary polynomial optimization over acyclic hypergraphs (English)
0 references
19 July 2024
0 references
