Talk:Geometric complexity theory: Difference between revisions

Content deleted Content added

Revision as of 21:23, 2 January 2018 edit TakuyaMurata (talk \| contribs) Extended confirmed users, IP block exemptions, Pending changes reviewers 92,676 edits mNo edit summary ← Previous edit		Latest revision as of 14:43, 28 July 2024 edit undo Supyovalk (talk \| contribs) Extended confirmed users 16,874 edits Assessment: banner shell, Computer science (Rater)
(3 intermediate revisions by 3 users not shown)
Line 1: {{WikiProject banner shell\|class=Start\|1= {{WikiProject Computer science}} }} ==[Untitled]== 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. -- [[User:TakuyaMurata\|Taku]] ([[User talk:TakuyaMurata\|talk]]) 21:22, 2 January 2018 (UTC) ::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". [[User:Stewbasic\|Stewbasic]] ([[User talk:Stewbasic\|talk]]) 05:57, 13 June 2018 (UTC)