Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

DAGSTUHL
2007

favoriteEmaildiscussreport

109views Software Engineering» more DAGSTUHL 2007»

Diagonal Circuit Identity Testing and Lower Bounds

13 years 10 months ago

Diagonal Circuit Identity Testing and Lower Bounds

Download www.math.uni-bonn.de

In this paper we give the ﬁrst 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 functions) is zero. We also prove an exponential lower bound showing that such a circuit will compute determinant or permanent only if there are exponentially many linear functions. Our techniques generalize to the following new results:

Nitin Saxena

Real-time Traffic

DAGSTUHL 2007 | Deterministic Polynomial Time | Diagonal Depth-3 Circuit | Linear Functions | Software Engineering |

claim paper

Related Content

» Derandomizing polynomial identity tests means proving circuit lower bounds

» A note on circuit lower bounds from derandomization

» Arithmetic Circuits A Chasm at Depth Four

» Shallow Circuits with HighPowered Inputs

» More on Noncommutative Polynomial Identity Testing

» On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

» New algorithms for singly linearly constrained quadratic programs subject to lower and upp...

» Deterministic identity testing of depth4 multilinear circuits with bounded top fanin

» Blackbox identity testing for bounded top fanin depth3 circuits the field doesnt matter

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2007
Where	DAGSTUHL
Authors	Nitin Saxena

Comments (0)