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.

65 pages

References in corpus (3)

• Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
• Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups
• On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis