Two central problems in computer science are P vs NP and the Complexity of matrix multiplication.
This introduction to algebraic Complexity Theory for graduate students and researchers in computer science and mathe.
Algebraic Geometry and representation Theory provide fertile ground for advancing work on these problems and others in complexity.
The second is of enormous practical and theoretical importance.
The first is also a leading candidate for the greatest unsolved problem in mathematics.
Two central problems in computer science are P vs NP and the Complexity of matrix multiplication