On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis
Computational Complexity
2009-08-19 v2
Abstract
Geometric complexity theory (GCT) is an approach to the vs. 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.
Keywords
Cite
@article{arxiv.0908.1936,
title = {On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis},
author = {Ketan D. Mulmuley},
journal= {arXiv preprint arXiv:0908.1936},
year = {2009}
}
Comments
71 pages