81 search results - page 2 / 17 » Elusive Functions and Lower Bounds for Arithmetic Circuits |
FOCS
2008
IEEE
14 years 1 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...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We derive quadratic lower bounds on the ∗-complexity of sum-of-products-of-sums (ΣΠΣ) formulas for classes of polynomials f that have too few partial derivatives for the techn...
UMC
2000
13 years 11 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
IPL
2007
13 years 7 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...