<p>I'm a mathematics student in my junior year and I'm interested in computational complexity and specially geometric complexity theory. I'm going to learn algebraic geometry and representation theory but I want to consider the parts that are related to geometric complexity theory so I wonder What are the topics that should be mastered by someone who wants to understand geometric computational complexity?</p>

<p>Surely, a lot of algebraic geometry and representation theory are needed, but which topics? and representation theory of what? finite groups? lie algebras(probably not) etc? and which topics in algebraic geometry are needed? It would be great if it is possible to name some topics that are required to be well understood in algebraic geometry and representation theory to before tackling  geometric  complexity theory. naming good resources ( texts etc ) that cover this background will be highly appreciated too.</p>

<p>I have asked the same question on math stackexchange but got no answer, so I thought I should ask it here.</p>

CC BY-SA 3.0
2016-11-30T21:14:20.567Z
I think Josh has already essentially answered this question: http://cstheory.stackexchange.com/a/15037/4896
Sasho Nikolov
CC BY-SA 3.0
2016-12-01T15:11:19.400Z
I heartily agree with @SashoNikolov. I appreciate the question, but the answer at http://cstheory.stackexchange.com/questions/15025/prerequisite-for-learning-gct is really good, and we don't want to dilute the information.
cody
<cc.complexity-theory><reference-request><lo.logic><time-complexity><p-vs-np>
What is the background in algebraic geometry and representation theory needed for geometric complexity theory?
FNH
# What is the background in algebraic geometry and representation theory needed for geometric complexity theory?

(Asked by: username_0 on 2016-11-29)

I'm a mathematics student in my junior year and I'm interested in computational complexity and specially geometric complexity theory. I'm going to learn algebraic geometry and representation theory but I want to consider the parts that are related to geometric complexity theory so I wonder 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? finite groups? lie algebras(probably not) etc? and which topics in algebraic geometry are needed? It would be great if it is possible to name some topics that are required to be well understood in algebraic geometry and representation theory to before tackling geometric complexity theory. naming good resources ( texts etc ) that cover this background will be highly appreciated too.

I have asked the same question on math stackexchange but got no answer, so I thought I should ask it here.

**Tags:** cc.complexity-theory, reference-request, lo.logic, time-complexity, p-vs-np

> **Comments:**
> **username_1**: I think Josh has already essentially answered this question: http://cstheory.stackexchange.com/a/15037/4896  
> **username_2**: I heartily agree with @SashoNikolov. I appreciate the question, but the answer at http://cstheory.stackexchange.com/questions/15025/prerequisite-for-learning-gct is really good, and we don't want to dilute the information.  

---

## 0 answers

