|
|
|
|
LEADER |
00000cam a2200000 4500 |
001 |
EBOOKCENTRAL_ocn922980784 |
003 |
OCoLC |
005 |
20240329122006.0 |
006 |
m o d |
007 |
cr |n||||||||| |
008 |
151017s2011 riu o 000 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d DEBSZ
|d OCLCQ
|d AU@
|d OCLCQ
|d LOA
|d OCLCO
|d OCLCF
|d OCLCQ
|d OCLCO
|d OCLCQ
|d OCLCO
|
020 |
|
|
|a 9780821882351
|
020 |
|
|
|a 082188235X
|
029 |
1 |
|
|a AU@
|b 000069466432
|
029 |
1 |
|
|a DEBSZ
|b 449621375
|
035 |
|
|
|a (OCoLC)922980784
|
050 |
|
4 |
|a QA241
|b R27 2011eb
|
082 |
0 |
4 |
|a 512.9/422
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a Gurvits, Leonid.
|
245 |
1 |
0 |
|a Randomization, Relaxation, and Complexity in Polynomial Equation Solving.
|
260 |
|
|
|a Providence :
|b American Mathematical Society,
|c 2011.
|
300 |
|
|
|a 1 online resource (230 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Contemporary Mathematics ;
|v v. 556
|
588 |
0 |
|
|a Print version record.
|
505 |
0 |
|
|a Contents -- Preface -- Multivariate Ultrametric Root Counting -- A Parallel Endgame -- Efficient Polynomial System Solving by Numerical Methods -- Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits -- Mixed Volume Computation in Solving Polynomial Systems -- A Search for an Optimal Start System for Numerical Homotopy Continuation -- Complex Tropical Localization, and Coamoebas of Complex Algebraic Hypersurfaces -- 1. Introduction -- 2. Preliminaries -- 3. Complex tropical hypersurfaces with a simplex Newton polytope
|
505 |
8 |
|
|a 4. Tropical mirror hypersurfaces5. Coamoebas of complex tropical hypersurfaces -- 6. Coamoebas of complex algebraic hypersurfaces -- 7. Examples of complex algebraic plane curves coamoebas -- References -- Randomization, Sums of Squares, Near-Circuits, and Faster Real Root Counting -- Dense Fewnomials -- The Numerical Greatest Common Divisor of Univariate Polynomials
|
590 |
|
|
|a ProQuest Ebook Central
|b Ebook Central Academic Complete
|
650 |
|
0 |
|a Number theory
|v Congresses.
|
650 |
|
0 |
|a Algorithms
|v Congresses.
|
650 |
|
0 |
|a Geometry, Algebraic
|v Congresses.
|
650 |
|
6 |
|a Théorie des nombres
|v Congrès.
|
650 |
|
6 |
|a Algorithmes
|v Congrès.
|
650 |
|
6 |
|a Géométrie algébrique
|v Congrès.
|
650 |
|
7 |
|a Algorithms
|2 fast
|
650 |
|
7 |
|a Geometry, Algebraic
|2 fast
|
650 |
|
7 |
|a Number theory
|2 fast
|
655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|
700 |
1 |
|
|a Pébay, Philippe.
|
700 |
1 |
|
|a Rojas, J. Maurice.
|
776 |
0 |
8 |
|i Print version:
|a Gurvits, Leonid.
|t Randomization, Relaxation, and Complexity in Polynomial Equation Solving.
|d Providence : American Mathematical Society, ©2011
|z 9780821852286
|
830 |
|
0 |
|a Contemporary Mathematics.
|
856 |
4 |
0 |
|u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3113335
|z Texto completo
|
936 |
|
|
|a BATCHLOAD
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL3113335
|
994 |
|
|
|a 92
|b IZTAP
|