Sciweavers

5 search results - page 1 / 1
» Rational Univariate Reduction via toric resultants
Sort
View
JSC
2008
78views more  JSC 2008»
13 years 7 months ago
Rational Univariate Reduction via toric resultants
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 ...
Koji Ouchi, John Keyser
ISSAC
2005
Springer
115views Mathematics» more  ISSAC 2005»
14 years 25 days ago
On the complexity of factoring bivariate supersparse (Lacunary) polynomials
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....
Erich Kaltofen, Pascal Koiran
COMPGEOM
2001
ACM
13 years 11 months ago
Computing a 3-dimensional cell in an arrangement of quadrics: exactly and actually!
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...
Nicola Geismann, Michael Hemmer, Elmar Schöme...
ENTCS
2006
114views more  ENTCS 2006»
13 years 7 months ago
Synthesis of Mealy Machines Using Derivatives
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...
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 5 days ago
Truthful mechanisms with implicit payment computation
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...