Sorting in c log n parallel steps
Combinatorica
Monotone circuits for connectivity require super-logarithmic depth
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Amplification by Read-Once Formulas
SIAM Journal on Computing
Analysis of low density codes and improved designs using irregular graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Analysis of random processes via And-Or tree evaluation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Amplification of probabilistic boolean formulas
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Modern Coding Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Expander graph arguments for message-passing algorithms
IEEE Transactions on Information Theory
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Hi-index | 0.00 |
We present a simple randomized construction of size O(n3) and depth 5.3logn+O(1) monotone circuits for the majority function on n variables. This result can be viewed as a reduction in the size and a partial derandomization of Valiant's construction of an O(n5.3) monotone formula, [15]. On the other hand, compared with the deterministic monotone circuit obtained from the sorting network of Ajtai, Komlós, and Szemerédi [1], our circuit is much simpler and has depth O(logn) with a small constant. The techniques used in our construction incorporate fairly recent results showing that expansion yields performance guarantee for the belief propagation message passing algorithms for decoding low-density parity-check (LDPC) codes, [3]. As part of the construction, we obtain optimal-depth linear-size monotone circuits for the promise version of the problem, where the number of 1's in the input is promised to be either less than one third, or greater than two thirds. We also extend these improvements to general threshold functions. At last, we show that the size can be further reduced at the expense of increased depth, and obtain a circuit for the majority of size and depth about $n^{1+\sqrt{2}}$ and 9.9logn.