## Abstract

We prove superlinear lower bounds for the number of edges in constant depth circuits with n inputs and up to n outputs. Our lower bounds are proved for all types of constant depth circuits, e.g., constant depth arithmetic circuits and constant depth Boolean circuits with arbitrary gates. The bounds apply for several explicit functions and, most importantly, for matrix product. In particular, we obtain the following results: 1. We show that the number of edges in any constant depth arithmetic circuit for matrix product (over any field) is superlinear in m^{2} (where m × m is the size of each matrix). That is, the lower bound is superlinear in the number of input variables. Moreover, if the circuit is bilinear, the result applies also for the case in which the circuit gets any product of two linear functions for free. 2. We show that the number of edges in any constant depth arithmetic circuit for the trace of the product of three matrices (over fields with characteristic O) is superlinear in m^{2}. (Note that the trace is a single-output function.) 3. We give explicit examples for n Boolean functions f_{1},⋯,f_{n}, such that any constant depth Boolean circuit with arbitrary gates for f_{1},⋯,f_{n} has a superlinear number of edges. The lower bound is also proved for circuits with arbitrary gates over any finite field. The bound applies for matrix product over finite fields as well as for several other explicit functions.

Original language | English (US) |
---|---|

Pages (from-to) | 488-513 |

Number of pages | 26 |

Journal | SIAM Journal on Computing |

Volume | 32 |

Issue number | 2 |

DOIs | |

State | Published - Feb 1 2003 |

Externally published | Yes |

## All Science Journal Classification (ASJC) codes

- Computer Science(all)
- Mathematics(all)

## Keywords

- Bounded depth circuits
- Lower bounds
- Matrix products
- Superconcentrators