SULJE VALIKKO

avaa valikko

Randomization, Relaxation, and Complexity in Polynomial Equation Solving
91,80 €
American Mathematical Society
Sivumäärä: 217 sivua
Asu: Pehmeäkantinen kirja
Julkaisuvuosi: 2011, 30.12.2011 (lisätietoa)
Kieli: Englanti
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.

Tuotetta lisätty
ostoskoriin kpl
Siirry koriin
LISÄÄ OSTOSKORIIN
Tuote on tilapäisesti loppunut ja sen saatavuus on epävarma. Seuraa saatavuutta.
Myymäläsaatavuus
Helsinki
Tapiola
Turku
Tampere
Randomization, Relaxation, and Complexity in Polynomial Equation Solving
Näytä kaikki tuotetiedot
ISBN:
9780821852286
Sisäänkirjautuminen
Kirjaudu sisään
Rekisteröityminen
Oma tili
Omat tiedot
Omat tilaukset
Omat laskut
Lisätietoja
Asiakaspalvelu
Tietoa verkkokaupasta
Toimitusehdot
Tietosuojaseloste