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...
The paper investigates the properties of certain biorthogonal polynomials appearing in a specific simultaneous Hermite–Pad´e approximation scheme. Associated with any totally ...
As integrated circuit technology plumbs ever greater depths in the scaling of feature sizes, maintaining the paradigm of deterministic Boolean computation is increasingly challeng...
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
We present a subresultant-based algorithm for deciding if the parametrization of a toric hypersurface is invertible or not, and for computing the inverse of the parametrization in...