De: R$ 1.371,44Por: R$ 960,01ou X de
Economia de R$ 411,43Calcule o frete:
Para envios internacionais, simule o frete no carrinho de compras.
Calcule o valor do frete e prazo de entrega para a sua região
Sinopse
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.
Ficha Técnica
Especificações
ISBN | 9780821852286 |
---|---|
Pré venda | Não |
Editor | GURVITS, LEONID |
Peso | 240g |
Editor para link | GURVITS LEONID |
Livro disponível - pronta entrega | Sim |
Dimensões | 23 x 16 x 1 |
Idioma | Inglês |
Tipo item | Livro Importado |
Número de páginas | 215 |
Número da edição | EDIÇAO - 2011 |
Código Interno | 672927 |
Código de barras | 9780821852286 |
Acabamento | PAPERBACK |
Editora | AMERICAN MATHEMATICAL SOCIETY |
Sob encomenda | Não |