On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
Abstract
Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.
 Publication:

arXiv eprints
 Pub Date:
 August 2009
 arXiv:
 arXiv:0908.1932
 Bibcode:
 2009arXiv0908.1932M
 Keywords:

 Computer Science  Computational Complexity
 EPrint:
 65 pages