MSRI-UP MSRI-UP 2017: Solving Systems of Polynomial Equations

Show All Collapse

Aug 04, 2017
Friday

09:00 AM - 09:15 AM		Final Presentations: Opening Remarks J. Maurice Rojas (Texas A & M University)
Location MSRI: Baker Board Room Video -- Abstract -- Supplements -- Show Detail

October 10, 2007 - October 11, 2007

Workshop Modern Mathematics: An Introduction to MSRI's 2008-09 Programs

Show All Collapse

Oct 11, 2007
Thursday

03:00 PM - 04:00 PM		Most Hard Equations are Easy J. Maurice Rojas (Texas A & M University)
Location -- Video -- Abstract While randomization has long been used profitably in optimization and computer science, it's importance in algebraic geometry has only recently been realized. In particular, the study of random systems of equations leads to some beautiful interactions between geometry, applications, and algorithmic complexity. We survey some of these developments from the point of view of polynomial system solving, focusing particularly on real (as opposed to complex) solutions. We will also see how centuries-old questions on counting real solutions can be solved with modern ideas from algebraic geometry (and a little randomization). No background in algebraic geometry or algorithms is assumed. Supplements -- Show Detail

April 12, 2004 - April 16, 2004

Show All Collapse

Apr 13, 2004
Tuesday

02:00 PM - 02:30 PM

Some New Complexity Bounds for Real Fewnomials
J. Maurice Rojas (Texas A & M University)