On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
classification
💻 cs.CC
keywords
complexitytheorygeometricalgebraicapproacharticleassumingbackground
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.