Constructive root bound for \(k\)-ary rational input numbers
type: Item
instance of: scholarly article
title: Constructive root bound for \(k\)-ary rational input numbers
zbMATH Open document ID: 1140.68549
author: Sylvain Pion
author: Chee K. Yap
published in: Theoretical Computer Science
publication date: 2007-01-09T00:00:00Z
Mathematics Subject Classification ID: 68W30
Mathematics Subject Classification ID: 65G20
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5083797
zbMATH Keywords: constructive root bounds
zbMATH Keywords: exact geometric computation
zbMATH Keywords: robust numerical algorithms
zbMATH Keywords: \(k\)-ary rational numbers
describes a project that uses: LEDA
MaRDI profile type: Publication
full work available at URL: j.tcs.2006.09.010
OpenAlex ID: W1963837830
cites work: A strong and easily computable separation bound for arithmetic expressions involving radicals
cites work: Q4796179
cites work: A new constructive root bound for algebraic expressions. (Extended abstract)
cites work: Q5797046
cites work: Identification of algebraic numbers
cites work: Q4093447
cites work: When Close Enough is Close Enough
cites work: Q4953977
cites work: Q5718722
DOI: 10.1016/J.TCS.2006.09.010
description: scientific article; zbMATH DE number 5083797