Advertisement

Introduction

  • Saugata Basu
  • Richard Pollack
  • Marie-Francoise Roy
Part of the Algorithms and Computation in Mathematics book series (AACIM, volume 10)

Abstract

Since a real univariate polynomial does not always have real roots, a very natural algorithmic problem, is to design a method to count the number of real roots of a given polynomial (and thus decide whether it has any). The “real root counting problem” plays a key role in nearly all the “algorithms in real algebraic geometry” studied in this book.

Keywords

Real Root Betti Number Polynomial System Great Common Divisor Quantifier Elimination 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Saugata Basu
    • 1
  • Richard Pollack
    • 2
  • Marie-Francoise Roy
    • 3
  1. 1.Georgia Institute of TechnologySchool of MathematicsAtlantaUSA
  2. 2.Courant Institute of Mathematical SciencesNew YorkUSA
  3. 3.IRMAR Campus de BeaulieuUniversité de Rennes IRennes cedexFrance

Personalised recommendations