Sciweavers

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

103

Voted

ECCC
2008

102views more ECCC 2008»

Elusive Functions and Lower Bounds for Arithmetic Circuits

15 years 2 months ago

Elusive Functions and Lower Bounds for Arithmetic Circuits

Download www.wisdom.weizmann.ac.il

Ran Raz

Real-time Traffic

ECCC 2008 |

claim paper

Related Content

» Polynomial Vicinity Circuits and Nonlinear Lower Bounds

» Lower Bounds and Separations for Constant Depth Multilinear Circuits

» A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits

» NonCommutative Arithmetic Circuits Depth Reduction and Size Lower Bounds

» Arithmetic Circuits A Chasm at Depth Four

» Timespace tradeoff lower bounds for integer multiplication and graphs of arithmetic functi...

» Resistant Polynomials and Stronger Lower Bounds for DepthThree Arithmetical Formulas

» Upper and Lower Bounds on ContinuousTime Computation

» Powering requires threshold depth 3

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	ECCC
Authors	Ran Raz

Comments (0)