Login / Signup
On the Complexity of Binary Polynomial Optimization Over Acyclic Hypergraphs.
Alberto Del Pia
Silvia Di Gregorio
Published in:
Algorithmica (2023)
Keyphrases
</>
np hard
global optimization
optimization algorithm
decision problems
polynomial hierarchy
vapnik chervonenkis dimension
data sets
worst case
optimization problems
optimization methods
graph theory
average case complexity
computational complexity
optimization process
low order
causal graph