85 search results - page 2 / 17 » Monotone Circuits for the Majority Function |
ICALP
2009
Springer
14 years 6 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
2010
IEEE
13 years 3 months ago
2010
IEEE
It is widely suspected that Erdos-R
SIAMCOMP
2010
13 years 13 days ago
2010
Hardness amplification is the fundamental task of converting a -hard function f : {0, 1}n {0, 1} into a (1/2 - )-hard function Amp(f), where f is -hard if small circuits fail to c...
ICCAD
2004
IEEE
14 years 2 months ago
2004
IEEE
We present techniques for improving the accuracy of geometric-programming (GP) based analog circuit design optimization. We describe major sources of discrepancies between the res...
FCT
2005
Springer
13 years 11 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...