activity
20202026
most citedOn the complexity of binary polynomial optimization over acyclic hypergraphs

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2023

A Knowledge Compilation Take on Binary Polynomial Optimization

Florent Capelli, Alberto Del Pia, Silvia Di Gregorio

The Binary Polynomial Optimization (BPO) problem is defined as the problem of maximizing a given polynomial function over all binary points. The main contribution of this paper is…