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

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

2009-08-13

arxiv.org/abs/0908.1936v2

Computer Science

Computational Complexity

71 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-701768