35 search results - page 1 / 7 » Polynomial Identity Testing for Depth 3 Circuits |
COCO
2006
Springer
13 years 6 months ago
2006
Springer
We study the identity testing problem for depth 3 arithmetic circuits ( circuit). We give the first deterministic polynomial time identity test for circuits with bounded top fanin...
STOC
2005
ACM
14 years 4 months ago
2005
ACM
In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs) are codes that allow the recovery of each message bit from a constant number of entries of ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
ECCC
2011
12 years 11 months ago
2011
Polynomial identity testing (PIT) problem is known to be challenging even for constant depth arithmetic circuits. In this work, we study the complexity of two special but natural ...
DAGSTUHL
2007
13 years 6 months ago
2007
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...