23 search results - page 1 / 5 » Bounds on the Size of Small Depth Circuits for Approximating... |
ICALP
2009
Springer
14 years 4 months ago
2009
Springer
In this paper, we show that for every constant 0 < < 1/2 and for every constant d 2, the minimum size of a depth d Boolean circuit that -approximates Majority function on n ...
FOCS
2000
IEEE
13 years 9 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
LATIN
2010
Springer
13 years 11 months ago
2010
Springer
We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In ...
FOCS
2008
IEEE
13 years 11 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...
CORR
2002
Springer
13 years 4 months ago
2002
Springer
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denot...