15 search results - page 3 / 3 » Blackbox Polynomial Identity Testing for Depth 3 Circuits |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show that proving exponential lower bounds on depth four arithmetic circuits imply exponential lower bounds for unrestricted depth arithmetic circuits. In other words, for expo...
ICALP
2010
Springer
13 years 10 months ago
2010
Springer
We say that a polynomial f(x1, . . . , xn) is indecomposable if it cannot be written as a product of two polynomials that are defined over disjoint sets of variables. The polynom...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
COCO
2009
Springer
13 years 12 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
STACS
2010
Springer
14 years 10 days ago
2010
Springer
Kabanets and Impagliazzo [KI04] show how to decide the circuit polynomial identity testing problem (CPIT) in deterministic subexponential time, assuming hardness of some explicit ...