Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Algorithmic and Quantitative Real Algebraic Geometry
 
Edited by: Saugata Basu Georgia Institute of Technology, Atlanta, GA
Laureano Gonzalez-Vega University of Cantabria, Santander, Spain
A co-publication of the AMS and DIMACS
Algorithmic and Quantitative Real Algebraic Geometry
Hardcover ISBN:  978-0-8218-2863-2
Product Code:  DIMACS/60
List Price: $90.00
MAA Member Price: $81.00
AMS Member Price: $72.00
eBook ISBN:  978-1-4704-4018-3
Product Code:  DIMACS/60.E
List Price: $84.00
MAA Member Price: $75.60
AMS Member Price: $67.20
Hardcover ISBN:  978-0-8218-2863-2
eBook: ISBN:  978-1-4704-4018-3
Product Code:  DIMACS/60.B
List Price: $174.00 $132.00
MAA Member Price: $156.60 $118.80
AMS Member Price: $139.20 $105.60
Algorithmic and Quantitative Real Algebraic Geometry
Click above image for expanded view
Algorithmic and Quantitative Real Algebraic Geometry
Edited by: Saugata Basu Georgia Institute of Technology, Atlanta, GA
Laureano Gonzalez-Vega University of Cantabria, Santander, Spain
A co-publication of the AMS and DIMACS
Hardcover ISBN:  978-0-8218-2863-2
Product Code:  DIMACS/60
List Price: $90.00
MAA Member Price: $81.00
AMS Member Price: $72.00
eBook ISBN:  978-1-4704-4018-3
Product Code:  DIMACS/60.E
List Price: $84.00
MAA Member Price: $75.60
AMS Member Price: $67.20
Hardcover ISBN:  978-0-8218-2863-2
eBook ISBN:  978-1-4704-4018-3
Product Code:  DIMACS/60.B
List Price: $174.00 $132.00
MAA Member Price: $156.60 $118.80
AMS Member Price: $139.20 $105.60
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 602003; 219 pp
    MSC: Primary 14; 68

    Algorithmic and quantitative aspects in real algebraic geometry are becoming increasingly important areas of research because of their roles in other areas of mathematics and computer science. The papers in this volume collectively span several different areas of current research.

    The articles are based on talks given at the DIMACS Workshop on “Algorithmic and Quantitative Aspects of Real Algebraic Geometry”. Topics include deciding basic algebraic properties of real semi-algebraic sets, application of quantitative results in real algebraic geometry towards investigating the computational complexity of various problems, algorithmic and quantitative questions in real enumerative geometry, new approaches towards solving decision problems in semi-algebraic geometry, as well as computing algebraic certificates, and applications of real algebraic geometry to concrete problems arising in robotics and computer graphics. The book is intended for researchers interested in computational methods in algebra.

    Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

    Readership

    Graduate students and research mathematicians interested in algebra and algebraic geometry and their applications.

  • Table of Contents
     
     
    • 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
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Accessibility – to request an alternate format of an AMS title
Volume: 602003; 219 pp
MSC: Primary 14; 68

Algorithmic and quantitative aspects in real algebraic geometry are becoming increasingly important areas of research because of their roles in other areas of mathematics and computer science. The papers in this volume collectively span several different areas of current research.

The articles are based on talks given at the DIMACS Workshop on “Algorithmic and Quantitative Aspects of Real Algebraic Geometry”. Topics include deciding basic algebraic properties of real semi-algebraic sets, application of quantitative results in real algebraic geometry towards investigating the computational complexity of various problems, algorithmic and quantitative questions in real enumerative geometry, new approaches towards solving decision problems in semi-algebraic geometry, as well as computing algebraic certificates, and applications of real algebraic geometry to concrete problems arising in robotics and computer graphics. The book is intended for researchers interested in computational methods in algebra.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

Readership

Graduate students and research mathematicians interested in algebra and algebraic geometry and their applications.

  • 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
Review Copy – for publishers of book reviews
Accessibility – to request an alternate format of an AMS title
Please select which format for which you are requesting permissions.