Sciweavers

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

127

CSR
2009
Springer

96views Theoretical Computer Science» more CSR 2009»

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

16 years 3 days ago

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

Download itcs.tsinghua.edu.cn

Maurice J. Jansen

Real-time Traffic

CSR 2009 | Theoretical Computer Science |

claim paper

Related Content

» Noncommutative circuits and the sumofsquares problem

» Nearly Tight Bounds for Testing Function Isomorphism

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CSR
Authors	Maurice J. Jansen

Comments (0)