On the complexity of evaluating highest weight vectors

26 Feb 2020 Markus Bläser Julian Dörfler Christian Ikenmeyer

Geometric complexity theory (GCT) is an approach towards separating algebraic complexity classes through algebraic geometry and representation theory. Originally Mulmuley and Sohoni proposed (SIAM J Comput 2001, 2008) to use occurrence obstructions to prove Valiant's determinant vs permanent conjecture, but recently B\"urgisser, Ikenmeyer, and Panova (Journal of the AMS 2019) proved this impossible... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTATIONAL COMPLEXITY
  • COMBINATORICS
  • REPRESENTATION THEORY
  • 68Q17, 68W30, 14Q15
  • I.1.2

Datasets


  Add Datasets introduced or used in this paper