GCT publications:

Overviews of GCT

The GCT program toward the P vs. NP problem, CACM, vol. 55, issue 6, June 2012, pp. 98-107.

On P vs. NP, and Geometric Complexity Theory, JACM, vol. 58, issue 2, April 2011.

FOCS 2010 Tutorial based on this overview.
GCT Papers

Lower Bounds in a Parallel Model without bit operations, SIAM J. Comput., 28, (1999), pp. 1460-1509.

Geometric complexity theory I:
An approach to the P vs. NP and related problems (with M. Sohoni), SIAM J. Comput., vol 31,
no. 2, pp. 496-526, (2001).

Geometric complexity theory II:
Towards explicit obstructions for embeddings among class varieties (with M. Sohoni) .
SIAM J. Comput., Vol. 38, Issue 3, June 2008.

Geometric complexity theory,
P vs. NP and explicit obstructions (with M. Sohoni),
in "Advances in Algebra and Geometry", Edited by C. Musili, the proceedings of the International
Conference on Algebra and Geometry, Hyderabad, 2001.

Geometric complexity theory III:
on deciding nonvanishing of a Littlewood-Richardson coefficient (with H. Narayanan and M. Sohoni),
Journal of Algebraic Combinatorics, pages 1-8, November, 2011.
Geometric complexity theory IV:
nonstandard quantum group for the Kronecker problem (with J. Blasiak and M. Sohoni), preprint, computer science
department, The University of Chicago, November 2011.

Geometric Complexity Theory V: Equivalence between blackbox derandomization of
polynomial identity testing and derandomization of Noether's Normalization Lemma,
arXiv:1209.5993 [cs.CC] (full version), December 2012.

Explicit Proofs and The Flip,
Technical Report, Computer Science Department, The University of Chicago, September 2010.

Geometric Complexity Theory VI: the flip via positivity,
Technical Report, computer science
department, The University of Chicago, January 2011.

Geometric Complexity Theory VII: Nonstandard quantum group for the
plethysm problem,
Technical Report TR-2007-14, computer science
department, The University of Chicago, September, 2007.

Geometric Complexity Theory VIII: On canonical bases for the nonstandard
quantum groups,
Technical Report TR-2007-15, computer science
department, The University of Chicago, September, 2007.

Lecture notes on GCT

On P vs. NP, Geometric Complexity Theory, and the Riemann Hypothesis,
Technical Report, Computer Science
department, The University of Chicago, August, 2009.
cs.ArXiv preprint cs.CC/0908.1936

This overview is based on a series of three lectures.
Video lectures in this series are available
here.
Geometric Complexity Theory: Introduction (with M. Sohoni),
Technical Report TR-2007-16, computer science
department, The University of Chicago, September, 2007.
Lecture notes for an introductory graduate course on geometric
complexity theory in the computer science department, the university
of Chicago.

On P vs. NP, Geometric Complexity Theory, and The Flip I: a high-level view,
Technical Report TR-2007-13, computer science
department, The University of Chicago, September, 2007.