2000 character limit reached
On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis (0908.1936v2)
Published 13 Aug 2009 in cs.CC
Abstract: Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems. A high level overview of this research plan and the results obtained so far was presented in a series of three lectures in the Institute of Advanced study, Princeton, Feb 9-11, 2009. This article contains the material covered in those lectures after some revision, and gives a mathematical overview of GCT. No background in algebraic geometry, representation theory or quantum groups is assumed.