Randomization, relaxation, and complexity in polynomial equation solving : Banff International Research Station Workshop on Randomization, Relaxation, and Complexity, February 28March 5, 2010, Banff, Ontario [i.e. Alberta], Canada
Material type: Computer fileSeries: Contemporary mathematics ; v. 556Publication details: Providence, R.I. : American Mathematical Society, 2011Description: 1 online resource (viii, 217 p. : ill.)ISBN: 9780821882351 (online)Subject(s): Algorithms | Geometry, Algebraic | Number theoryOnline resources: Click here to access onlineItem type | Current library | Call number | URL | Status | Date due | Barcode | Item holds |
---|---|---|---|---|---|---|---|
electronic book | ICTS | Link to resource | Accessible Online | EBK21560 |
Includes bibliographical references.
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 ; Randomization, sums of squares, nearcircuits, and faster real root counting ; Dense fewnomials ; The numerical greatest common divisor of univariate polynomials Martin 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
There are no comments on this title.