For more information about this meeting, contact Mary Anne Raymond.
|Title:||Kernel counting and algebraic complexity theory|
|Seminar:||Slow Pitch Seminar|
|Speaker:||Jason Morton, Penn State University|
|Many central questions in computational complexity, including how many operations are required for matrix multiplication and whether P=NP can be phrased and attacked using algebraic geometry. We describe the basic idea of such approaches, which generally rely on the use of tensors to "lift" computations into the sort of spaces where geometers feel comfortable. This lifting approach is related to the power provided by quantum computing, and some of the open questions involve investigating the boundary between classical and quantum computing.|
Room Reservation Information
|Date:||03 / 16 / 2010|
|Time:||05:00pm - 06:10pm|