Author:
O’Donnell Ryan,Wimmer Karl
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Ajtai, M.:
$\Sigma^1_1$
-formulae on finite structures. Annals of Pure and Applied Logic 24, 1–48 (1983)
2. Ajtai, M.: Approximate counting with uniform constant-depth circuits. In: Advances in Computational Complexity Theory, pp. 1–20. Amer. Math. Soc., Providence, RI (1993)
3. Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in c logn parallel steps. Combinatorica 3, 1–19 (1983)
4. Benjamini, I., Kalai, G., Schramm, O.: Noise sensitivity of boolean functions and applications to percolation. Inst. Hautes Études Sci. Publ. Math. 90, 5–43 (1999)
5. Ben-Or, M., Linial, N.: Collective coin flipping. In: Micali, S. (ed.) Randomness and Computation, Academic Press, New York (1990)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Depth- Threshold Circuits vs. Depth-(+1) AND-OR Trees;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Optimal Explicit Small-Depth Formulas for the Coin Problem;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Depth Two (n-2)-Majority Circuits for n-Majority;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2018-09-01
4. An Average-Case Depth Hierarchy Theorem for Boolean Circuits;Journal of the ACM;2017-10-15
5. On DNF Approximators for Monotone Boolean Functions;Automata, Languages, and Programming;2014