174 search results - page 1 / 35 » Comparing Real Algebraic Numbers of Small Degree |
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
TCS
2008
15 years 6 days ago
2008
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...
DAGSTUHL
2008
15 years 1 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...
106
click to vote
SPAA
2000
ACM
15 years 4 months ago
2000
ACM
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper),...
WEA
2009
Springer
15 years 7 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...