A new constructive root bound for algebraic expressions

@inproceedings{Li2001ANC,
  title={A new constructive root bound for algebraic expressions},
  author={Chen Li and Chee-Keng Yap},
  booktitle={SODA},
  year={2001}
}
Computing effective root bounds for constant algebraic expressions is a critical problem in the Exact Geometric Computation approach to robust geometric programs. Classical root bounds are often non-constructive. Recently, various authors have proposed bounding methods which might be called constructive root bounds. For the important class of radical expressions, Burnikel et al (BFMS) have provided a constructive root bound which, in the division-free case, is an improvement over previously… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-8 of 8 references

~tef~nescu. Polynomials: An Algorithmic Approach

  • D. M. Mignotte
  • 1999
Highly Influential
7 Excerpts

The exact computation paradigm

  • C. K. Yap, T. Dub
  • Computing in Euclidean Geometry,
  • 1995
Highly Influential
7 Excerpts

The complexity of robot motion planning

  • J. F. Canny
  • ACM Doctoral Dissertion Award Series. The MIT…
  • 1988
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…