10.1145/acmotherconferencesACM Other Conferences000000010.5555/0000000Proceedings of the Dagstuhl Seminar Proceedings, Volume 741110.4230/DagSemProc.07411.44Diagonal Circuit Identity Testing and Lower BoundsSaxenaNitinAuthor2201200811

In this talk we give a 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