Algebra and combinatorics in geometric complexity theory
Algebra Seminar
27th October 2026, 4:00 pm – 5:00 pm
Fry Building, 2.04
Initiated in 2001, geometric complexity theory is a program towards proving computational complexity lower bounds, towards resolving P vs NP and related conjectures. Key conjectures of the original approach have been disproved, but in this talk we discuss a new form of geometric complexity theory, and we focus on its new algebraic and combinatorial challenges.
Comments are closed.