<p>We have a quadratic lower bound for the Permanent versus Determinant problem.</p>
<p>Why is it difficult for <span class="math-container">$GCT$</span> to improve it?</p>

CC BY-SA 4.0
2020-08-22T12:14:47.550Z
Do you mind telling us what GCT means?
Yixin Cao
CC BY-SA 4.0
2023-12-15T13:16:46.527Z
I guess https://en.m.wikipedia.org/wiki/Geometric_complexity_theory
Hermann Gruber
<cc.complexity-theory><lower-bounds>
Why is it difficult for $GCT$ to prove super quadratic lower bound?
VS.
# Why is it difficult for $GCT$ to prove super quadratic lower bound?

(Asked by: username_0 on 2020-07-01)

We have a quadratic lower bound for the Permanent versus Determinant problem.

Why is it difficult for $GCT$ to improve it?

**Tags:** cc.complexity-theory, lower-bounds
> **Comments:**
> **username_1**: Do you mind telling us what GCT means?  
> **username_2**: I guess https://en.m.wikipedia.org/wiki/Geometric_complexity_theory  

---

## 0 answers

