On P vs. NP, Geometric Complexity Theory, and the Flip I: a high level view

Abstract

Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle, called the flip, without assuming any background in algebraic geometry or representation theory.

103 pages

References in corpus (4)

• Honeycombs and sums of Hermitian matrices
• Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry
• Geometric Complexity Theory V: On deciding nonvanishing of a generalized Littlewood-Richardson coefficient
• An Invitation to the Generalized Saturation Conjecture

Cited by in corpus (1)

• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH