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!
Recent Advances in Real Complexity and Computation
 
Edited by: José Luis Montaña Universidad de Cantabria, Santander, Spain
Luis M. Pardo Universidad de Cantabria, Santander, Spain
Front Cover for Recent Advances in Real Complexity and Computation
Available Formats:
Electronic ISBN: 978-1-4704-1409-2
Product Code: CONM/604.E
185 pp 
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $60.80
Front Cover for Recent Advances in Real Complexity and Computation
Click above image for expanded view
  • Front Cover for Recent Advances in Real Complexity and Computation
  • Back Cover for Recent Advances in Real Complexity and Computation
Recent Advances in Real Complexity and Computation
Edited by: José Luis Montaña Universidad de Cantabria, Santander, Spain
Luis M. Pardo Universidad de Cantabria, Santander, Spain
Available Formats:
Electronic ISBN:  978-1-4704-1409-2
Product Code:  CONM/604.E
185 pp 
List Price: $76.00
MAA Member Price: $68.40
AMS Member Price: $60.80
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 6042013
    MSC: Primary 03; 14; 65;

    This volume is composed of six contributions derived from the lectures given during the UIMP-RSME Lluís Santaló Summer School on “Recent Advances in Real Complexity and Computation”, held July 16–20, 2012, in Santander, Spain.

    The goal of this Summer School was to present some of the recent advances on Smale's 17th Problem: “Can a zero of \(n\) complex polynomial equations in \(n\) unknowns be found approximately, on the average, in polynomial time with a uniform algorithm?”

    These papers cover several aspects of this problem: from numerical to symbolic methods in polynomial equation solving, computational complexity aspects (both worse and average cases and both upper and lower complexity bounds) as well as aspects of the underlying geometry of the problem. Some of the contributions also deal with either real or multiple solutions solving.

    This book is published in cooperation with Real Sociedád Matematica Española.
    Readership

    Graduate students and research mathematicians interested in the complexity of computation.

  • Table of Contents
     
     
    • Articles
    • Martijn Baartse and Klaus Meer - Topics in real and complex number complexity theory
    • Bernd Bank, Marc Giusti and Joos Heintz - Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity
    • Carlos Beltrán and Michael Shub - The complexity and geometry of numerically solving polynomial systems.
    • M. Giusti and J.-C. Yakoubsohn - Multiplicity hunting and approximating multiple roots of polynomial systems
    • Joos Heintz, Bart Kuijpers and Andrés Rojas Paredes - On the intrinsic complexity of elimination problems in effective algebraic geometry
    • Gregorio Malajovich - Newton iteration, conditioning and zero counting
  • Additional Material
     
     
  • Request Review Copy
  • Get Permissions
Volume: 6042013
MSC: Primary 03; 14; 65;

This volume is composed of six contributions derived from the lectures given during the UIMP-RSME Lluís Santaló Summer School on “Recent Advances in Real Complexity and Computation”, held July 16–20, 2012, in Santander, Spain.

The goal of this Summer School was to present some of the recent advances on Smale's 17th Problem: “Can a zero of \(n\) complex polynomial equations in \(n\) unknowns be found approximately, on the average, in polynomial time with a uniform algorithm?”

These papers cover several aspects of this problem: from numerical to symbolic methods in polynomial equation solving, computational complexity aspects (both worse and average cases and both upper and lower complexity bounds) as well as aspects of the underlying geometry of the problem. Some of the contributions also deal with either real or multiple solutions solving.

This book is published in cooperation with Real Sociedád Matematica Española.
Readership

Graduate students and research mathematicians interested in the complexity of computation.

  • Articles
  • Martijn Baartse and Klaus Meer - Topics in real and complex number complexity theory
  • Bernd Bank, Marc Giusti and Joos Heintz - Polar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity
  • Carlos Beltrán and Michael Shub - The complexity and geometry of numerically solving polynomial systems.
  • M. Giusti and J.-C. Yakoubsohn - Multiplicity hunting and approximating multiple roots of polynomial systems
  • Joos Heintz, Bart Kuijpers and Andrés Rojas Paredes - On the intrinsic complexity of elimination problems in effective algebraic geometry
  • Gregorio Malajovich - Newton iteration, conditioning and zero counting
Please select which format for which you are requesting permissions.