53 search results - page 2 / 11 » Real algebraic numbers and polynomial systems of small degre... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine word. We pack polynomials into integers and perform sever...
DAGSTUHL
2008
13 years 6 months ago
2008
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
Let R be a real closed field, P, Q ⊂ R[X1, . . . , Xk] finite subsets of polynomials, with the degrees of the polynomials in P (resp. Q) bounded by d (resp. d0). Let V ⊂ Rk b...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...