A sparsity condition on the hypergraph of a polynomial allows polynomial-time solution of box-constrained optimization over the unit hypercube by fixing some variables to binary values and locally eliminating others.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
A sparsity condition on the hypergraph of a polynomial allows polynomial-time solution of box-constrained optimization over the unit hypercube by fixing some variables to binary values and locally eliminating others.