Revision #3 Authors: Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi

Accepted on: 4th September 2013 10:06

Downloads: 4621

Keywords:

Agrawal-Vinay (FOCS 2008), Koiran (TCS 2012) and Tavenas (MFCS 2013) have recently shown that an $\exp(\omega(\sqrt{n}\log n))$ lower bound for depth four homogeneous circuits computing the permanent with bottom layer of $\times$ gates having fanin bounded by $\sqrt{n}$ translates to super-polynomial lower bound for general arithmetic circuits computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via such homogeneous depth four circuits with bounded bottom fanin.

We show here that any homogeneous depth four arithmetic circuit with bottom fanin bounded by $\sqrt{n}$ computing the permanent (or the determinant) must be of size $\exp(\Omega(\sqrt{n}))$.

Includes an upper bound for the dimension of shifted partials of the determinant

Revision #2 Authors: Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi

Accepted on: 23rd March 2013 08:10

Downloads: 3124

Keywords:

Agrawal-Vinay (FOCS 2008) and Koiran (TCS 2012) have recently shown that an $\exp(\omega(\sqrt{n}\log^2 n))$ lower bound for depth four homogeneous circuits computing the permanent with bottom layer of $\times$ gates having fanin bounded by $\sqrt{n}$ translates to super-polynomial lower bound for general arithmetic circuits computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via such homogeneous depth four circuits with bounded bottom fanin.

We show here that any homogeneous depth four arithmetic circuit with bottom fanin bounded by $\sqrt{n}$ computing the permanent (or the determinant) must be of size $\exp(\Omega(\sqrt{n}))$.

The lower bound now works for slightly more general circuits that are sums of polynomials of the form $F(Q_1, \cdots, Q_m)$ where $m = \sqrt{n}$ and $\deg(Q_i) = \sqrt{n}$ (and $F$ can be arbitrary).

Revision #1 Authors: Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi

Accepted on: 10th September 2012 08:22

Downloads: 3593

Keywords:

Agrawal-Vinay (FOCS 2008) and Koiran (TCS 2012) have recently shown that an $\exp(\omega(\sqrt{n}\log^2 n))$ lower bound for depth four homogeneous circuits computing the permanent with bottom layer of $\times$ gates having fanin bounded by $\sqrt{n}$ translates to super-polynomial lower bound for a general arithmetic circuits computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via such homogeneous depth four circuits with bounded bottom fanin.

We show here that any homogeneous depth four arithmetic circuit with bottom fanin bounded by $\sqrt{n}$ computing the permanent (or the determinant) must be of size $\exp(\Omega(\sqrt{n}))$.

Earlier version gave an exponential bound only for constant bottom fan-in. This is a substantial improvement and takes us very close to the chasm.

TR12-098 Authors: Ankit Gupta, Pritish Kamath, Neeraj Kayal, Ramprasad Saptharishi

Publication: 3rd August 2012 17:06

Downloads: 3662

Keywords:

Agrawal and Vinay (FOCS 2008) have recently shown that an exponential lower bound for depth four homogeneous circuits with bottom layer of $\times$ gates having sublinear fanin translates to an exponential lower bound for a general arithmetic circuit computing the permanent. Motivated by this, we examine the complexity of computing the permanent and determinant via homogeneous depth four circuits with bounded bottom fanin.

We show here that any homogeneous depth four arithmetic circuit with bounded bottom fanin computing the permanent (or the determinant) must be of exponential size.