Revision as of 15:30, 18 August 2018 edit S142857 (talk \| contribs) 51 edits Added a reference to back an existing claim. Tag: 2017 wikitext editor ← Previous edit		Revision as of 15:39, 18 August 2018 edit undo S142857 (talk \| contribs) 51 edits →Further reading: Updated reference. Tag: 2017 wikitext editor Next edit →
Line 25: K. D. Mulmuley, H. Narayanan, and M. Sohoni. Geometric complexity theory III: on deciding nonvanishing of a Littlewood-Richardson coefficient. J. Algebraic Combin. 36 (2012), no. 1, 103–110. K. D. Mulmuley. Geometric Complexity Theory V: ~~Equivalence~~Efficient ~~between~~algorithms ~~blackbox~~for ~~derandomization~~Noether ofnormalization. ~~polynomial~~J. ~~identity~~Amer. ~~testing~~Math. ~~and~~Soc. ~~derandomization~~30 of(2017), ~~Noether's Normalization Lemma~~no. ~~FOCS 2012~~1, ~~also~~225-309. [[arxiv:1209.5993\|arXiv:1209.5993 [cs.CC]]] K. D. Mulmuley. Geometric Complexity Theory VI: the flip via positivity., Technical Report, Computer Science department, The University of Chicago, January 2011.

Geometric complexity theory: Difference between revisions