Author:
H�stad Johan,Goldmann Mikael
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference23 articles.
1. M. Ajtai. ? 1 1 on finite structures.Annals of Pure and Applied Logic, 24:1?48, 1983.
2. E. Allender. A note on the power of threshold circuits.Proceedings 30'th Annual Symposium on Foundations of Computer Science, pages 580?584, 1989.
3. N. Alon and R. B. Boppana. The monotone circuit complexity of boolean functions.Combinatorica, 7:1?22, 1987.
4. A. E. Andreev. On a method for obtaining lower bounds for the complexity of individual monotone functions.Dokl. Ak. Nauk. SSSR 282, pages 1033?1037, 1985. English translation inSov. Math. Dokl., 31:530?534, 1985.
5. L. Babai, N. Nisan, and M. Szegedy. Multipary protocols and logspacehard pseudorandom sequences.Proceedings of 21 st Annual ACM Symposium on Theory of Computing, pages 1?11, 1989.
Cited by
111 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献