8 citations · 18 across the 25 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2020★ 1 cited
On the complexity of binary polynomial optimization over acyclic hypergraphs
Alberto Del Pia, Silvia Di Gregorio
In this work we advance the understanding of the fundamental limits of computation for Binary Polynomial Optimization (BPO), which is the problem of maximizing a given polynomial f…
cs.DM2014★ 8 cited
Mixed-integer Quadratic Programming is in NP
Alberto Del Pia, Santanu S. Dey, Marco Molinaro
Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In…