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
The following link can be shared to navigate to this page. You can select the link to copy or click the 'Copy To Clipboard' button 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
Front Cover for Algorithmic and Quantitative Real Algebraic Geometry
Available Formats:
Hardcover ISBN: 978-0-8218-2863-2
Product Code: DIMACS/60
219 pp 
List Price: $85.00
MAA Member Price: $76.50
AMS Member Price: $68.00
Electronic ISBN: 978-1-4704-4018-3
Product Code: DIMACS/60.E
219 pp 
List Price: $80.00
MAA Member Price: $72.00
AMS Member Price: $64.00
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $127.50
MAA Member Price: $114.75
AMS Member Price: $102.00
Front Cover for Algorithmic and Quantitative Real Algebraic Geometry
Click above image for expanded view
  • Front Cover for Algorithmic and Quantitative Real Algebraic Geometry
  • Back Cover for Algorithmic and Quantitative Real Algebraic Geometry
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
Available Formats:
Hardcover ISBN:  978-0-8218-2863-2
Product Code:  DIMACS/60
219 pp 
List Price: $85.00
MAA Member Price: $76.50
AMS Member Price: $68.00
Electronic ISBN:  978-1-4704-4018-3
Product Code:  DIMACS/60.E
219 pp 
List Price: $80.00
MAA Member Price: $72.00
AMS Member Price: $64.00
Bundle Print and Electronic Formats and Save!
This product is available for purchase as a bundle. Purchasing as a bundle enables you to save on the electronic version.
List Price: $127.50
MAA Member Price: $114.75
AMS Member Price: $102.00
  • Book Details
     
     
    DIMACS - Series in Discrete Mathematics and Theoretical Computer Science
    Volume: 602003
    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.

    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
  • Request Review Copy
Volume: 602003
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.

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
Please select which format for which you are requesting permissions.