Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > DEPTH 3 OR 4:
Reports tagged with depth 3 or 4:
TR07-124 | 23rd November 2007
Nitin Saxena

#### Diagonal Circuit Identity Testing and Lower Bounds

In this paper we give the first deterministic polynomial time algorithm for testing whether a {\em diagonal} depth-$3$ circuit $C(\arg{x}{n})$ (i.e. $C$ is a sum of powers of linear functions) is zero. We also prove an exponential lower bound showing that such a circuit will compute determinant or permanent only ... more >>>

ISSN 1433-8092 | Imprint