Constructive root bound for \(k\)-ary rational input numbers

DOI10.1016/j.tcs.2006.09.010zbMath1140.68549OpenAlexW1963837830MaRDI QIDQ861279

Sylvain Pion, Chee-Keng Yap

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.010

zbMATH Keywords

exact geometric computation\(k\)-ary rational numbersconstructive root boundsrobust numerical algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Algorithms with automatic result verification (65G20)

Related Items (3)

On design and implementation of a generic number type for real algebraic number computations based on expression dags ⋮ In Praise of Numerical Computation ⋮ Much Ado about Zero

Uses Software

• LEDA

Cites Work

• A strong and easily computable separation bound for arithmetic expressions involving radicals
• When Close Enough is Close Enough
• Identification of algebraic numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructive root bound for \(k\)-ary rational input numbers