Spring 2012, Thursdays, Milner 216, 4:00-4:50 PM

Date: March 2

"  Polynomials Systems and Computational Complexity
(Visiting Prospective Students) "

  Korben Rusek  


How hard is it to solve a polynomial system? What if we just want to know if a system is "feasible" (has a solution)? In this talk, we will discuss polynomial systems, feasibility, and solutions and how these relate to computational complexity. Previous knowledge of computational complexity is not required. Not much mathematical background is required, but you should know that $n^2$ grows faster than $n$, because, well, $2\gt 1$.