This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...