12 search results - page 2 / 3 » Improved complexity bounds for real root isolation using Con... |
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...
CASC
2009
Springer
13 years 11 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We study the complexity of computing the real solutions of a bivariate polynomial system using the recently proposed algorithm Bisolve [3]. Bisolve is a classical elimination metho...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We continue a study initiated by Kraj´ıˇcek of a Resolutionlike proof system working with clauses of linear inequalities, R(CP). For all proof systems of this kind Kra...