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.
KeywordsReal Root Betti Number Polynomial System Great Common Divisor Quantifier Elimination
Unable to display preview. Download preview PDF.