Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DEPTH FOUR:
Reports tagged with Depth Four:
TR11-153 | 13th November 2011
Ankit Gupta, Neeraj Kayal, Satyanarayana V. Lokam

Reconstruction of Depth-4 Multilinear Circuits with Top fanin 2

We present a randomized algorithm for reconstructing multilinear depth-4 arithmetic circuits with fan-in 2 at the top + gate. The algorithm is given blackbox access to a multilinear polynomial f in F[x_1,..,x_n] computable by a multilinear Sum-Product-Sum-Product(SPSP) circuit of size s and outputs an equivalent multilinear SPSP circuit, runs ... more >>>

TR14-005 | 14th January 2014
Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas

We show here a $2^{\Omega(\sqrt{d} \cdot \log N)}$ size lower bound for homogeneous depth four arithmetic formulas. That is, we give
an explicit family of polynomials of degree $d$ on $N$ variables (with $N = d^3$ in our case) with $0, 1$-coefficients such that
for any representation of ... more >>>

TR15-052 | 6th April 2015

Depth-4 Identity Testing and Noether's Normalization Lemma

Revisions: 1

We consider the \emph{black-box} polynomial identity testing problem for a sub-class of
depth-4 circuits. Such circuits compute polynomials of the following type:
$C(x) = \sum_{i=1}^k \prod_{j=1}^{d_i} Q_{i,j},$
where $k$ is the fan-in of the top $\Sigma$ gate and $r$ is the maximum degree of the ... more >>>

TR20-032 | 12th March 2020
Suryajith Chillara

On Computing Multilinear Polynomials Using Multi-r-ic Depth Four Circuits

Revisions: 2

In this paper, we are interested in understanding the complexity of computing multilinear polynomials using depth four circuits in which polynomial computed at every node has a bound on the individual degree of $r$ (referred to as multi-$r$-ic circuits). The goal of this study is to make progress towards proving ... more >>>

TR20-033 | 12th March 2020
Suryajith Chillara

New Exponential Size Lower Bounds against Depth Four Circuits of Bounded Individual Degree

Revisions: 1

Kayal, Saha and Tavenas [Theory of Computing, 2018] showed that for all large enough integers $n$ and $d$ such that $d\geq \omega(\log{n})$, any syntactic depth four circuit of bounded individual degree $\delta = o(d)$ that computes the Iterated Matrix Multiplication polynomial ($IMM_{n,d}$) must have size $n^{\Omega\left(\sqrt{d/\delta}\right)}$. Unfortunately, this bound ... more >>>

ISSN 1433-8092 | Imprint