Home » Workshop » Schedules » Most Hard Equations are Easy
Most Hard Equations are Easy
October 11, 2007 (03:00 PM PDT - 04:00 PM PDT)
J. Maurice Rojas (Texas A & M University)
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
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.
No Notes/Supplements Uploaded
No Video Files Uploaded