Much Ado about Zero
From MaRDI portal
Recommendations
Cites work
- A new constructive root bound for algebraic expressions. (Extended abstract)
- A strong and easily computable separation bound for arithmetic expressions involving radicals
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Classroom examples of robustness problems in geometric computations
- Constructing roadmaps of semi-algebraic sets. I: Completeness
- Constructive root bound for \(k\)-ary rational input numbers
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- scientific article; zbMATH DE number 1639663 (Why is no real title available?)
- scientific article; zbMATH DE number 52177 (Why is no real title available?)
- scientific article; zbMATH DE number 1263428 (Why is no real title available?)
- scientific article; zbMATH DE number 1305089 (Why is no real title available?)
- scientific article; zbMATH DE number 1746666 (Why is no real title available?)
- scientific article; zbMATH DE number 1368469 (Why is no real title available?)
- scientific article; zbMATH DE number 1875420 (Why is no real title available?)
- Identification of algebraic numbers
- LOOK: A lazy object-oriented kernel design for geometric computation
- Towards exact geometric computation
- When Close Enough is Close Enough
Cited in
(7)- A separation bound for real algebraic expressions
- Much ado about Mathieu
- scientific article; zbMATH DE number 6538210 (Why is no real title available?)
- On zero-error computation
- Much ado about nothing
- On design and implementation of a generic number type for real algebraic number computations based on expression dags
- More ado about nothing
This page was built for publication: Much Ado about Zero
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3644735)