Login / Signup
On the complexity of binary polynomial optimization over acyclic hypergraphs.
Alberto Del Pia
Silvia Di Gregorio
Published in:
SODA (2022)
Keyphrases
</>
optimization algorithm
global optimization
np hard
optimization method
computational complexity
worst case
np complete
neural network
computational cost
optimization problems
optimization process
binary valued
polynomial hierarchy
data sets
space complexity
optimization model