Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials
Sign Up to like & getrecommendations! Published in 2021 at "Foundations of Computational Mathematics"
DOI: 10.1007/s10208-021-09496-x
Abstract: Various key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems are based on sums… read more here.
Keywords: hypercube via; boolean hypercube; hypercube; nonnegative circuit ... See more keywords