Sciweavers

MOC
2010
12 years 11 months ago
On the span of polynomials with integer coefficients
Following a paper of R. Robinson, we classify all hyperbolic polynomials in one variable with integer coefficients and span less than 4 up to degree 13, and with some additional h...
Stefano Capparelli, Alberto Del Fra, Carlo Sci&ogr...
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 4 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 4 months ago
Improved complexity bounds for real root isolation using Continued Fractions
We consider the problem of isolating the real roots of a square-free polynomial with integer coefficients using (variants of) the continued fraction algorithm (CF). We introduce a...
Elias P. Tsigaridas
COMPGEOM
2004
ACM
13 years 8 months ago
Intersecting quadrics: an efficient and exact implementation
We present the first complete, exact, and efficient C++ implementation for parameterizing the intersection of two implicit quadrics with integer coefficients of arbitrary size. It...
Sylvain Lazard, Luis Mariano Peñaranda, Syl...