On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
arXiv:0908.1932
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.
65 pages
References in corpus (4)
- Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
- Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient
- Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups
- On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis