On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810)
From MaRDI portal
scientific article; zbMATH DE number 7729241
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of binary polynomial optimization over acyclic hypergraphs |
scientific article; zbMATH DE number 7729241 |
Statements
On the complexity of binary polynomial optimization over acyclic hypergraphs (English)
0 references
17 August 2023
0 references
binary polynomial optimization
0 references
strongly polynomial-time algorithm
0 references
acyclic hypergraphs
0 references
hardness of approximation
0 references
0 references
0 references
