However, Ketan Mulmuley believes the program, if viable, is likely to take about 100 years before it can settle the P vs. NP problem.
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems.
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties.
Geometric complexity theory III: on deciding nonvanishing of a Littlewood-Richardson coefficient.
Geometric Complexity Theory V: Efficient algorithms for Noether normalization.
Geometric Complexity Theory VI: the flip via positivity., Technical Report, Computer Science department, The University of Chicago, January 2011.