On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
Computational Complexity
2009-08-19 v2
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.
Cite
@article{arxiv.0908.1932,
title = {On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier},
author = {Ketan D. Mulmuley},
journal= {arXiv preprint arXiv:0908.1932},
year = {2009}
}
Comments
65 pages