On the complexity of binary polynomial optimization over acyclic hypergraphs.
Alberto Del PiaSilvia Di GregorioPublished in: CoRR (2020)
Keyphrases
- polynomial hierarchy
- optimization process
- vapnik chervonenkis dimension
- np hard
- global optimization
- optimization algorithm
- optimization problems
- np complete
- databases
- database schemes
- linear programming
- worst case
- decision problems
- special case
- search algorithm
- constrained optimization
- database systems
- learning algorithm
- data sets
- hypertree decomposition
- hypergraph model