Comparing real algebraic numbers of small degree

DOI10.1007/978-3-540-30140-0_58MaRDI QIDQ5464622zbMATH OpenOpenAlexFDO

Authors Ioannis Z. Emiris, Elias P. Tsigaridas

Publication date 18 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100428

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computer science aspects of computer-aided design (68U07) Symbolic computation and algebraic computation (68W30)

Recommendations

• Real algebraic numbers and polynomial systems of small degree
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• Complexity of computation on real algebraic numbers
• Computer Algebra in Scientific Computing
• NC algorithms for real algebraic numbers

Cited in

(9)

• Real algebraic numbers and polynomial systems of small degree
• Improving root separation bounds
• On the complexity of real root isolation using continued fractions
• Exact, efficient, and complete arrangement computation for cubic curves
• The predicates of the Apollonius diagram: algorithmic analysis and implementation
• An exact and efficient approach for computing a cell in an arrangement of quadrics
• Real Algebraic Numbers: Complexity Analysis and Experimentation
• Using signature sequences to classify intersection curves of two quadrics
• Can we compute the similarity between surfaces?

Describes a project that uses

Uses Software

• AXIOM
• Kinetic Framework
• LEDA
• SYNAPS
• Maple
• ISOLATE

This page was built for publication: Comparing real algebraic numbers of small degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464622)