AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Algorithmic and Quantitative Real Algebraic Geometry
About this Title
Saugata Basu, Georgia Institute of Technology, Atlanta, GA and Laureano Gonzalez-Vega, University of Cantabria, Santander, Spain, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
2003; Volume 60
ISBNs: 978-0-8218-2863-2 (print); 978-1-4704-4018-3 (online)
DOI: https://doi.org/10.1090/dimacs/060
MathSciNet review: MR1995008
MSC: Primary 14-06
ReadershipTable of Contents
Front/Back Matter
Chapters
- Characterization and description of basic semialgebraic sets
- Constructive approaches to representation theorems in finitely generated real algebras
- Combinatorial characterizations of algebraic sets
- Lower bounds and real algebraic geometry
- The Viro method applied with quadratic transforms
- On the number of connected components of the relative closure of a semi-Pfaffian family
- How to show a set is not algebraic
- Minimizing polynomial functions
- Patterns of dependence among powers of polynomials
- Efficient algorithms based on critical points method
- Enumerative real algebraic geometry
- Combinatorial roadmaps in configuration spaces of simple planar polygons
- Visibility computations: From discrete algorithms to real algebraic geometry