Sciweavers

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

120

Voted

APPROX
2006
Springer

105views Algorithms» more APPROX 2006»

Monotone Circuits for the Majority Function

15 years 6 months ago

Monotone Circuits for the Majority Function

Download www.cs.ubc.ca

We present a simple randomized construction of size O

Shlomo Hoory, Avner Magen, Toniann Pitassi

Real-time Traffic

Algorithms | APPROX 2006 | Deterministic Monotone Circuit | Monotone Circuits | Monotone Formula |

claim paper

Related Content

» Monotone Circuits for Matching Require Linear Depth

» Monotone circuits for monotone weighted threshold functions

» Monotone Circuits for Weighted Threshold Functions

» On the Monotone Circuit Complexity of Quadratic Boolean Functions

» Bounds on the Size of Small Depth Circuits for Approximating Majority

» The Monotone Complexity of kclique on Random Graphs

» Hardness Amplification Proofs Require Majority

» Techniques for improving the accuracy of geometricprogramming based analog circuit design ...

» On the Incompressibility of Monotone DNFs

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	APPROX
Authors	Shlomo Hoory, Avner Magen, Toniann Pitassi

Comments (0)