Presented By: Department of Mathematics
Junior Colloquium Series Seminar
The mathematics of computational complexity (Research at Michigan Series)
Why it appears to be much harder to compute the permanent than the determinant of a (complex) matrix? Essentially, this is one of the seven "million dollars" millennium problems, and, arguably, the one that we understand the least. I plan to discuss what kind of mathematics we can possibly use to answer this and similar questions. An attractive feature of the computational complexity questions is that a) they sound elementary and b) virtually anything (algebra, geometry/topology, analysis, none of the above) can be a key to the answer. In particular, I plan to discuss some recent connections to complex analysis and statistical physics. Speaker(s): Alexander Barvinok (Michigan)
Co-Sponsored By
Explore Similar Events
-
Loading Similar Events...