Algorithmic and Quantitative Real Algebraic Geometry: DIMACS Workshop, Algorithmic and Quantitative Aspects of Real Algebraic, Geometry in Mathematics and Computer Science, March 12-16, 2001, DIMACS Center

Characterization and description of basic semialgebraic sets by C. Andradas Constructive approaches to representation theorems in finitely generated real algebras by D. Bailey and V. Powers Combinatorial characterizations of algebraic sets by I. Bonnard Lower bounds and real algebraic geometry by P. Burgisser The Viro method applied with quadratic transforms by B. Chevallier On the number of connected components of the relative closure of a semi-Pfaffian family by A. Gabrielov and T. Zell How to show a set is not algebraic by C. McCrory Minimizing polynomial functions by P. A. Parrilo and B. Sturmfels Patterns of dependence among powers of polynomials by B. Reznick Efficient algorithms based on critical points method by F. Rouillier Enumerative real algebraic geometry by F. Sottile Combinatorial roadmaps in configuration spaces of simple planar polygons by I. Streinu Visibility computations: From discrete algorithms to real algebraic geometry by T. Theobald.