We describe algorithms for solving a given system of multivariate polynomial equations via the Rational Univariate Reduction (RUR). We compute the RUR from the toric resultant of ...
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
We present two approaches to the problem of calculating a cell in a 3-dimensional arrangement of quadrics. The first approach solves the problem using rational arithmetic. It work...
In Rutten [13] the theoretical basis was given for the synthesis of binary Mealy machines from specifications in 2-adic arithmetic. This construction is based on the symbolic comp...
Helle Hvid Hansen, David Costa, Jan J. M. M. Rutte...
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...