A strong and easily computable separation bound for arithmetic expressions involving radicals
type: Item
instance of: scholarly article
title: A strong and easily computable separation bound for arithmetic expressions involving radicals
zbMATH Open document ID: 0953.68136
DOI: 10.1007/S004530010005
author: Rudolf Fleischer
author: K. Mehlhorn
author: Christoph Burnikel
author: Stefan Schirra
published in: Algorithmica
publication date: 2001-01-29T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 1444099
zbMATH Keywords: exact geometric computation
zbMATH Keywords: separation bound
MaRDI profile type: Publication
full work available at URL: s004530010005
OpenAlex ID: W2024331629
Recommended article: A separation bound for real algebraic expressions
Recommended article: Q4796179
Recommended article: Constructive root bound for \(k\)-ary rational input numbers
Recommended article: Constructive root bound for k -ary rational input numbers
Recommended article: A new constructive root bound for algebraic expressions. (Extended abstract)
Recommended article: Bounds on degrees of \(p\)-adic separating polynomials
Recommended article: An extension of the roots separation theorem
Recommended article: Solvability by radicals from an algorithmic point of view
Recommended article: Explicit Lower Bounds for Rational Approximation to Algebraic Numbers
Recommended article: Bounds for arithmetic multiplicities
description: scientific article; zbMATH DE number 1444099