Papers on relation between computational complexity and algebraic geometry/topology? I was wondering what papers I should read to understand this question


  A unexpected connection to other areas of mathematics such as algebraic geometry or higher cohomology. Perhaps even an area of mathematics not yet developed. Perhaps someone will develop a whole new direction for mathematics in order to handle the P versus NP question.
  -From Fortnow 2002


Another phrasing of the question would be "What papers should I read to create a connection from computational complexity to algebraic geometry / topology?"

I have looked at Geometric Complexity Theory already . Also papers in Topological Quantum Computation which I have read enough papers that I am already familiar with the field. Am I missing anything?
As background, you should definitely study Ben-Or's work on lower bounds, as well as Mulmuley's P vs NC paper.