Algorithms In Real Algebraic Geometry (algorithms And Computation In Mathematics)
by Saugata Basu /
2003 / English / DjVu
3.6 MB Download
The algorithmic problems of real algebraic geometry such as real
root counting, deciding the existence of solutions of systems of
polynomial equations and inequalities, or deciding whether two
points belong in the same connected component of a semi-algebraic
set occur in many contexts. In this first-ever graduate textbook
on the algorithmic aspects of real algebraic geometry, the main
ideas and techniques presented form a coherent and rich body of
knowledge, linked to many areas of mathematics and computing.
The algorithmic problems of real algebraic geometry such as real
root counting, deciding the existence of solutions of systems of
polynomial equations and inequalities, or deciding whether two
points belong in the same connected component of a semi-algebraic
set occur in many contexts. In this first-ever graduate textbook
on the algorithmic aspects of real algebraic geometry, the main
ideas and techniques presented form a coherent and rich body of
knowledge, linked to many areas of mathematics and computing.
Mathematicians already aware of real algebraic geometry will find
relevant information about the algorithmic aspects, and
researchers in computer science and engineering will find the
required mathematical background.
Mathematicians already aware of real algebraic geometry will find
relevant information about the algorithmic aspects, and
researchers in computer science and engineering will find the
required mathematical background.
Being self-contained the book is accessible to graduate students
and even, for invaluable parts of it, to undergraduate students.
Being self-contained the book is accessible to graduate students
and even, for invaluable parts of it, to undergraduate students.
