On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis

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.

71 pages

References in corpus (3)

• Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
• Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups
• An Invitation to the Generalized Saturation Conjecture

Cited by in corpus (1)

• On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier