Sciweavers

37 search results - page 5 / 8
» On the Degree of Univariate Polynomials Over the Integers
Sort
View
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 8 months ago
A Faster Algorithm for Quasi-convex Integer Polynomial Optimization
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...
Robert Hildebrand, Matthias Köppe
TC
2002
13 years 8 months ago
A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields
We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary t points, we show ...
Zeljko Zilic, Zvonko G. Vranesic
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 8 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
JSC
2006
132views more  JSC 2006»
13 years 8 months ago
From an approximate to an exact absolute polynomial factorization
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
Guillaume Chèze, André Galligo
ISSAC
2007
Springer
131views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Some recent progress in exact linear algebra and related questions
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
Gilles Villard