2000 character limit reached
On P vs. NP, Geometric Complexity Theory, Explicit Proofs and the Complexity Barrier
Published 13 Aug 2009 in cs.CC | (0908.1932v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.