This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science articles
This article is out of date. Burgisser, Ikenmeyer, and Panova showed this approach can't work in their paper "No Occurence Obstructions in Geometric Complexity Theory." I haven't edited wikipedia in years, I would prefer if someone else could take care of this edit.
Thank you for the info. I have added an external link to a relevant mathverflow discussion, for now. I don’t feel I have enough understanding of the theory to tell whether the program is doomed or not. -- Taku (talk) 21:22, 2 January 2018 (UTC)[reply]
As noted on the mathoverflow link, the referenced paper rules out the possibility of occurrence obstructions, but "the possibility of multiplicity obstructions is still open". Stewbasic (talk) 05:57, 13 June 2018 (UTC)[reply]
