Randomization Relaxation And Complexity In Polynomial Equation Solving Banff International Research Station Workshop On Randomization Relaxation Ontario Canada Leonid Gurvits by Leonid Gurvits, Philippe Pebay, J. Maurice Rojas, David Thompson (ed.) 9780821852286, 0821852280 instant download after payment.

This volume corresponds to the Banff International Research Station Workshop on Randomization, Relaxation, and Complexity, held from February 28-March 5, 2010 in Banff, Ontario, Canada. This volume contains a sample of advanced algorithmic techniques underpinning the solution of systems of polynomial equations. The papers are written by leading experts in algorithmic algebraic geometry and touch upon core topics such as homotopy methods for approximating complex solutions, robust floating point methods for clusters of roots, and speed-ups for counting real solutions. Vital related topics such as circuit complexity, random polynomials over local fields, tropical geometry, and the theory of fewnomials, amoebae, and coamoebae are treated as well. Recent advances on Smale's 17th Problem, which deals with numerical algorithms that approximate a single complex solution in average-case polynomial time, are also surveyed