<p>There was a subsequent extension by <a href="http://www.mi.ras.ru/~razborov/depth3.ps">Grigoriev and Razborov (PS)</a> that has a shorter exposition of proof. </p>

CC BY-SA 3.0
2013-02-20T03:02:55.063Z
2013-02-20T03:02:55.063Z
Ramprasad
<p>Is there an alternate proof or an exposition of the result of Grigoriev and Karpinski (STOC 1998, doi:<a href="http://dx.doi.org/10.1145/276698.276872">10.1145/276698.276872</a>) on the <a href="http://logic.pdmi.ras.ru/~grigorev/pub/determinant_stoc.ps">exponential lower bounds for Depth 3 arithmetic circuits</a> computing $\mathsf{DET}_{n\times n}$ over a fixed finite field?</p>

<p>I could not understand section 2 of the paper. What is the intuition behind considering the F-linear operator $T_g$?</p>

<circuit-complexity><arithmetic-circuits>
Is there an alternate proof or an exposition of: Exponential lower bound for $\Sigma\Pi\Sigma$ circuits [Grigoriev-Karpinski(1998)]?
Stattrav
# Is there an alternate proof or an exposition of: Exponential lower bound for $\Sigma\Pi\Sigma$ circuits [Grigoriev-Karpinski(1998)]?

(Asked by: username_0 on 2013-02-19)

Is there an alternate proof or an exposition of the result of Grigoriev and Karpinski (STOC 1998, doi:[10.1145/276698.276872](http://dx.doi.org/10.1145/276698.276872)) on the [exponential lower bounds for Depth 3 arithmetic circuits](http://logic.pdmi.ras.ru/~grigorev/pub/determinant_stoc.ps) computing $\mathsf{DET}\_{n\times n}$ over a fixed finite field?

I could not understand section 2 of the paper. What is the intuition behind considering the F-linear operator $T\_g$?

**Tags:** circuit-complexity, arithmetic-circuits


---

## 1 answers

### Answer by username_1 on 2013-02-20. Score: 7

There was a subsequent extension by [Grigoriev and Razborov (PS)](http://www.mi.ras.ru/~razborov/depth3.ps) that has a shorter exposition of proof.


---

