45 search results - page 4 / 9 » Numeric-Symbolic Algorithms for Evaluating One-Dimensional A... |
PODS
2006
ACM
14 years 7 months ago
2006
ACM
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
WEA
2009
Springer
14 years 2 months ago
2009
Springer
We present a cgal-based univariate algebraic kernel, which provides certi ed real-root isolation of univariate polynomials with integer coe cients and standard functionalities such...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
CP
2000
Springer
13 years 11 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
DAGSTUHL
2008
13 years 9 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...