Towards faster real algebraic numbers

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 221-228

  Rioboo, Renaud ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Algebraic integers; Algebraic numbers; Fractions; Real closed fields; Real closure; Sub resultants

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); INTEGER PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS;

ALGEBRAIC INTEGERS; REAL ALGEBRAIC NUMBERS;

ALGEBRA;

EID: 0036042404     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780535     Document Type: Conference Paper

References (19)

1. On the combinatorial and algebraic complexity of quantifier elimination
2. Real zeros of polynomials
3. Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
4. About a new method method for computing in algebraic number fields
5. Optimizations of the subresultant algorithm
6. Dynamic evaluation and real closure
7. Dynamic evaluation and real closure, implementation in axiom
8. Generic closure of an ordered field, implementation in axiom
9. Elementary constructive theory of ordered fields
10. New structure theorems for subresultants
11. Generalized polynomial remainder sequences
12. Polynomial gcd computations over towers of algebraic extensions
13. Computation of the real closure of an ordered field
14. Computing in the field of complex algebraic numbers
15. A real root calculus