• Corpus ID: 4747707

On top fan-in vs formal degree for depth-3 arithmetic circuits

  title={On top fan-in vs formal degree for depth-3 arithmetic circuits},
  author={Mrinal Kumar},
  journal={Electron. Colloquium Comput. Complex.},
  • Mrinal Kumar
  • Published 1 April 2018
  • Mathematics, Computer Science
  • Electron. Colloquium Comput. Complex.
We show that over the field of complex numbers, \emph{every} homogeneous polynomial of degree $d$ can be approximated (in the border complexity sense) by a depth-$3$ arithmetic circuit of top fan-in at most $d+1$. This is quite surprising since there exist homogeneous polynomials $P$ on $n$ variables of degree $2$, such that any depth-$3$ arithmetic circuit computing $P$ must have top fan-in at least $\Omega(n)$. As an application, we get a new tradeoff between the top fan-in and formal degree… 

On the complexity of evaluating highest weight vectors

In the setting of interest in GCT, the NP-hardness of the evaluation of HWVs in general is proved, and efficient algorithms are given if the treewidth of the corresponding Young-diagram is small, where the point of evaluation is concisely encoded as a noncommutative algebraic branching program.

A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials

A deterministic polynomial time approximation scheme (PTAS) for computing the algebraic rank of a set of bounded degree polynomials and a new technique which allows the higher degree generalization of the results by Bläser, Jindal, Pandey (CCC’17) is presented.

Algebraic branching programs, border complexity, and tangent spaces

The set of polynomials with ABP width complexity at most k is closed for single-(source,sink) ABPs and not closed for trace ABPs, and an intriguing connection between tangent spaces and the vector space of flows on the ABP is revealed.

Derandomization from Algebraic Hardness: Treading the Borders

This is the first HSG in the algebraic setting that yields a complete derandomization of polynomial identity testing (PIT) for general circuits from a suitable algebraic hardness assumption.



Improved bounds for reduction to depth 4 and depth 3

Depth-3 arithmetic circuits over fields of characteristic zero

This paper proves quadratic lower bounds for depth-3 arithmetic circuits over fields of characteristic zero for the elementary symmetric functions, the (trace of) iterated matrix multiplication, and the determinant, and gives new shorter formulae of constant depth for the Elementary symmetrical functions.

Arithmetic Circuits: A Chasm at Depth Three

We show that, over Q, if an n-variate polynomial of degree d = n<sup>O(1)</sup> is computable by an arithmetic circuit of size s (respectively by an arithmetic branching program of size s) then it

Diagonal Circuit Identity Testing and Lower Bounds

In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonaldepth-3 circuit C(x 1 ,...,x n ) (i.e. Cis a sum of powers of linear functions) is zero. We also

Computing Algebraic Formulas Using a Constant Number of Registers

It is shown that, over an arbitrary ring, the functions computed by polynomial-size algebraic formulas are also computed by algebraic straight-line programs that use only three registers, which is an improvement over previous methods that require the number of registers to be logarithmic in the size of the formulas.

AC^0 o MOD_2 Lower Bounds for the Boolean Inner Product

The first superlinear lower bound for the Boolean Inner Product function against AC^0 o MOD2 of depth four or greater is given, and an optimal bound on the maximum difference between two discrete distributions’ values at 0 is proved, given that their first d moments match.

On Algebraic Branching Programs of Small Width

It is proved that the class VPN can be described as the class of families that admit a hypercube summation of polynomially bounded dimension over a product of poynomially many affine linear forms, which gives the first separations of algebraic complexity classes from their nondeterministic analogs.

Affine projections of symmetric polynomials

  • Amir Shpilka
  • Computer Science, Mathematics
    Proceedings 16th Annual IEEE Conference on Computational Complexity
  • 2001
It is shown that an answer of the following problem will imply lower bounds on symmetric circuits for many polynomials, and the main technical contribution relates the maximal dimension of linear subspaces on which S/sub m//sup d/ vanishes, and lower bounds to the symmetric model.

Arithmetic Circuits: A Chasm at Depth Four

  • Manindra AgrawalV. Vinay
  • Mathematics, Computer Science
    2008 49th Annual IEEE Symposium on Foundations of Computer Science
  • 2008
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for exponential sized

The Complexity of Factors of Multivariate Polynomials

It is proved that in the framework of algebraic complexity, there are no such families of polynomial functions ofPolynomially bounded degree over fields of characteristic zero.