000			01828nmm a2200193Ia 4500
008			230306s9999||||xx |||||||||||||||||und||
020			_a9780821882351 (online)
245		0	_aRandomization, relaxation, and complexity in polynomial equation solving : _bBanff International Research Station Workshop on Randomization, Relaxation, and Complexity, February 28March 5, 2010, Banff, Ontario [i.e. Alberta], Canada
260			_aProvidence, R.I. : _bAmerican Mathematical Society, _c2011
300			_a1 online resource (viii, 217 p. : ill.)
490			_aContemporary mathematics _vv. 556 _x10983627
504			_aIncludes bibliographical references.
505			_tMultivariate 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 ; Randomization, sums of squares, nearcircuits, and faster real root counting ; Dense fewnomials ; The numerical greatest common divisor of univariate polynomials _rMartin Avendano and Ashraf Ibrahim ; Daniel J Bates Jonathan D Hauenstein and Andrew J Sommese ; Carlos Beltran and Luis Miguel Pardo ; Bruno Grenet Erich L Kaltofen Pascal Koiran and Natacha Portier ; TsungLin Lee and TienYien Li ; Anton Leykin ; Mounir Nisse ; Osbert Bastani Christopher J Hillar Dimitar Popov and J Maurice Rojas ; Korben Rusek Jeanette Shakalli and Frank Sottile ; Zhonggang Zeng
650			_aAlgorithms
650			_aGeometry, Algebraic
650			_aNumber theory
700			_aGurvits Leonid
856			_uhttp://www.ams.org/conm/556/
999			_c28973 _d28973