03821cam  2200469 i 450000100090000000300050000900500170001400600190003100700150005000800410006502000270010604000340013305000230016708200170019008400500020711100640025724503080032126401210062930000380075033600210078833700250080933800230083449000530085750400510091050511050096150600500206653300950211653800360221158800470224765000420229465001580233665001230249465001030261765001540272065000290287465001290290370000560303270000530308877601200314185600430326185600470330417803442RPAM20170613140933.0a      b    101 0 cr/|||||||||||170613s2013    riu     ob    101 0 eng    a9781470414092 (online)  aDLCbengcDLCerdadDLCdRPAM00aQA267.7b.U36 201200a511.3/52223  a03D15a14Qxxa14Q20a49Q15a65-XXa65H202msc2 aUIMP-RSME Lluis Santalâo Summerd(2012 :cSantander, Spain)10aRecent advances in real complexity and computation :h[electronic resource] bUIMP-RSME Lluis A. Santalâo Summer School 2012, recent advances in real complexity and computation, July 16-20, 2012, Universidad Internacional Menâendez Pelayo, Santander, Spain /cJose Luis Montaäna, Luis M. Pardo, editors. 1aProvidence, Rhode Island :bAmerican Mathematical Society ;a[Madrid] :bReal Sociedad Matematica Espaänola,c[2013]  a1 online resource (xi, 185 pages)  atext2rdacontent  aunmediated2rdamedia  avolume2rdacarrier0 aContemporary mathematics, x1098-3627 ; vv. 604  aIncludes bibliographical references and index.00tTopics in real and complex number complexity theory /rMartijn Baartse and Klaus Meer --uhttp://www.ams.org/conm/604/uhttps://doi.org/10.1090/conm/604/12067tPolar, bipolar and copolar varieties: Real solving of algebraic varieties with intrinsic complexity /rBernd Bank, Marc Giusti and Joos Heintz --uhttp://www.ams.org/conm/604/uhttps://doi.org/10.1090/conm/604/12068tThe complexity and geometry of numerically solving polynomial systems. /rCarlos Beltrâan and Michael Shub --uhttp://www.ams.org/conm/604/uhttps://doi.org/10.1090/conm/604/12069tMultiplicity hunting and approximating multiple roots of polynomial systems /rM. Giusti and J.-C. Yakoubsohn --uhttp://www.ams.org/conm/604/uhttps://doi.org/10.1090/conm/604/12070tOn the intrinsic complexity of elimination problems in effective algebraic geometry /rJoos Heintz, Bart Kuijpers and Andrâes Rojas Paredes --uhttp://www.ams.org/conm/604/uhttps://doi.org/10.1090/conm/604/12071tNewton iteration, conditioning and zero counting /rGregorio Malajovich --uhttp://www.ams.org/conm/604/uhttps://doi.org/10.1090/conm/604/120721 aAccess is restricted to licensed institutions  aElectronic reproduction.bProvidence, Rhode Island :cAmerican Mathematical Society.d2013  aMode of access : World Wide Web  aDescription based on print version record. 0aComputational complexityvCongresses. 7aMathematical logic and foundations -- Computability and recursion theory -- Complexity of computation (including implicit computational complexity).2msc 7aAlgebraic geometry -- Computational aspects in algebraic geometry -- Computational aspects in algebraic geometry.2msc 7aAlgebraic geometry -- Computational aspects in algebraic geometry -- Effectivity, complexity.2msc 7aCalculus of variations and optimal control; optimization -- Manifolds -- Geometric measure and integration theory, integral and normal currents.2msc 7aNumerical analysis.2msc 7aNumerical analysis -- Nonlinear algebraic or transcendental equations -- Global methods, including homotopy approaches.2msc1 aMontaäna, Jose Luis,d1961-eeditor of compilation.1 aPardo, L. M.q(Luis M.),eeditor of compilation.0 iPrint version: tRecent advances in real complexity and computation :w(DLC)   2013022512x0271-4132z97808218915064 3Contentsuhttp://www.ams.org/conm/604/4 3Contentsuhttps://doi.org/10.1090/conm/604