Polynomial Identity Testing for Depth 3 Circuits
Tuesday 06 May 2008, 17.15, N327 (Römerstr. 164)
Identity Testing is the computational problem of checking whether a given arithmetic circuit is the zero polynomial. Its deterministic complexity is unknown and a solution would have important repercussions in the complexity theory. In this talk I will motivate the problem and solve it in some special cases especially when the depth of the circuit is just 3.