What are the topics that should be mastered by someone who wants to understand geometric computational complexity?
Surely, a lot of algebraic geometry and representation theory are needed, but which topics? and representation theory of what? groups, lie algebras etc? naming good resources ( texts etc ) that cover this background will be highly appreciated.
I'm not sure if this question should be asked here in math.se or in theoretical computer science forum, so if you find it more useful to post it there, please tell me.