Revision as of 07:32, 25 October 2013 edit RDT (talk \| contribs) 295 edits No edit summary ← Previous edit		Revision as of 07:34, 25 October 2013 edit undo RDT (talk \| contribs) 295 edits →References Next edit →
Line 8: == References == [http://cstheory.stackexchange.com/a/17629 Wikipedia-style explanation of Geometric Complexity Theory] by Joshua Grochow [GCT1] K. D. Mulmuley and M. Sohoni. Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems. SIAM J. Comput. 31(2), 496–526, 2001. Line 16 ⟶ 18: [GCT5] K. D. Mulmuley. Geometric Complexity Theory V: Equivalence between blackbox derandomization of polynomial identity testing and derandomization of Noether's Normalization Lemma. FOCS 2012, also arXiv:1209.5993. [GCT6] K. D. Mulmuley. Geometric Complexity Theory VI: the flip via positivity., Technical Report, Computer Science department, The University of Chicago, January 2011. == External links ==

Geometric complexity theory: Difference between revisions