Algorithmic and Quantitative Real Algebraic Geometry

The 13 papers in this collection from the March 2001 workshop consider the algebraic properties of real semi-algebraic sets, algorithmic and quantitative questions in real enumerative geometry, and new approaches for solving decision problems in semi-algebraic geometry. Topics include the number of connected components of the relative closure of a semi-Pfaffian family, patterns of dependence among powers of polynomials, efficient algorithms based on the critical points method, and combinatorial roadmaps in configuration spaces of simple planar polygons. No index is provided. Annotation (c) Book News, Inc., Portland, OR (booknews.com)