Geometric Complexity Theory VI: the flip via saturated and positive integer programming in representation theory and algebraic geometry

Understand

This article belongs to a series on geometric complexity theory (GCT), an approach to the P vs.

• NP and related problems through algebraic geometry and representation theory.
• The basic principle behind this approach is called the flip.
• In essence, it reduces the negative hypothesis in complexity theory (the lower bound problems), such as the P vs.