Funder
Russian Science Foundation
MK
Russian Academic Excellence Project ’5-100’
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference27 articles.
1. Allender, E., Koucký, M.: Amplifying lower bounds by means of self-reducibility. J. ACM 57(3), 14:1–14:36 (2010)
2. Amano, K., Yoshida, M.: Depth two (n − 2)-majority circuits for n-majority. Preprint (2017)
3. Bruno, B.: Personal communication (2017)
4. Xi, C., Oliveira, I.C., Servedio, R.A.: Addition is exponentially harder than counting for shallow monotone circuits. Electronic Colloquium on Computational Complexity (ECCC) 22, 123 (2015)
5. Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009)