Sciweavers

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

106

Voted

FOCS
2009
IEEE

120views Theoretical Computer Science» more FOCS 2009»

Blackbox Polynomial Identity Testing for Depth 3 Circuits

15 years 9 months ago

Blackbox Polynomial Identity Testing for Depth 3 Circuits

Download web.mit.edu

Neeraj Kayal, Shubhangi Saraf

Real-time Traffic

FOCS 2009 | Theoretical Computer Science |

claim paper

Related Content

» An Almost Optimal Rank Bound for Depth3 Identities

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

» Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuit...

» Polynomial Identity Testing for Depth 3 Circuits

» A Case of Depth3 Identity Testing Sparse Factorization and Duality

» Diagonal Circuit Identity Testing and Lower Bounds

» Arithmetic circuits the chasm at depth four gets wider

» More on Noncommutative Polynomial Identity Testing

» The Power of Depth 2 Circuits over Algebras

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	FOCS
Authors	Neeraj Kayal, Shubhangi Saraf

Comments (0)