Sciweavers

125 search results - page 2 / 25
» The Complexity of Rooted Phylogeny problems
Sort
View
CASC
2009
Springer
157views Mathematics» more  CASC 2009»
13 years 12 months ago
On the Complexity of Reliable Root Approximation
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...
Michael Kerber
CORR
2010
Springer
111views Education» more  CORR 2010»
13 years 5 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
ICCBR
2009
Springer
13 years 10 months ago
Determining Root Causes of Drilling Problems by Combining Cases and General Knowledge
Oil well drilling is a complex process which frequently leads to operational problems. In order to deal with some of these problems, knowledge intensive case based reasoning (KiCBR...
Samad Valipour Shokouhi, Agnar Aamodt, Pål S...
JUCS
2010
106views more  JUCS 2010»
13 years 3 months ago
A Heuristic Approach to Positive Root Isolation for Multiple Power Sums
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
Ming Xu, Chuandong Mu, Zhenbing Zeng, Zhi-bin Li
AISC
2006
Springer
13 years 9 months ago
An Algorithm for Computing the Complete Root Classification of a Parametric Polynomial
Abstract. The Complete Root Classification for a univariate polynomial with symbolic coefficients is the collection of all the possible cases of its root classification, together w...
Songxin Liang, David J. Jeffrey