This is the first graduate textbook on the algorithmic aspects of real algebraic geometry. The main ideas and techniques presented form a coherent and rich body of knowledge. Mathematicians will find relevant information about the algorithmic aspects. 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. This second edition contains several recent results on discriminants of symmetric matrices and other relevant topics.
Introduction.- 1 Algebraically Closed Fields.- 2 Real Closed Fields.- 3 Semi-Algebraic Sets.- 4 Algebra.- 5 Decomposition of Semi-Algebraic Sets.- 6 Elements of Topology.- 7 Quantitative Semi-Algebraic Geometry.- 8 Complexity of Basic Algorithms.- 9 Cauchy Index and Applications.- 10 Real Roots.- 11 Cylindrical Decomposition Algorithm.- 12 Polynomial System Solving.- 13 Existential Theory of the Reals.- 14 Quantifier Elimination.- 15 Computing Roadmaps and Connected Components of Algebraic Sets.- 16 Computing Roadmaps and Connected Components of Semi-Algebraic Sets.- References.- Index of Notation.- Index.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados