Author:
Davydow A. P.,Nikolenko S. I.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference53 articles.
1. M. Ajtai, $$ \Sigma_1^1 $$ -formulae on finite structures,” Ann. Pure Logic, 24, 1–48 (1983).
2. M. Ajtai and C. Dwork, “A public-key cryptosystem with worst-case/average-case equivalence,” in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (1997), pp. 284–293.
3. E. Allender, “Circuit complexity before the dawn of the new millenium,” in: Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science (1996), pp. 1–18.
4. N. Alon, M. Karchmer, and A. Wigderson, “Linear circuits over GF(2),” SIAM J. Comput., 19, No. 6, 1064–1067 (1990).
5. N. Blum, “A boolean functions requiring 3n network size,” Theoret. Comput. Sci., 28, 337–345 (1984).