66 citations · 187 across the 28 of their papers we have counts for
1 paper · 2 filters
Etienne de Klerk, Monique Laurent, Zhao Sun
The problem of minimizing a polynomial over the standard simplex is one of the basic NP-hard nonlinear optimization problems --- it contains the maximum clique problem in graphs as…