Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference6 articles.
1. S. A. Cook, C. Dwork, andR. Reischuk: Upper and lower time bounds for parallel random access machines without simultaneous writes,SIAM J. Computing 15 (1986), 87?97.
2. Anna G�l: Lower bounds for the complexity of reliable Boolean circuits with noisy gates, in:32nd IEEE Symp. on Foundations of Computer Science, San Juan, Puerto Rico 1991, 594?601.
3. N. Nisan: CREW PRAM's and decision trees, in:Proc 21th ACM Symposium on Theory of Computing, Seattle WA, 1989, 327?335.
4. N. Nisan, andM. Szegedy: On the degree of Boolean functions as real polynomials, in:Proc. 24th ACM Symposium on Theory of Computing, Victoria, B.C., 1992, 462?467.
5. H. U. Simon: A tight ?(loglogn) bound on the time for parallel RAM's to compute nondegenerate Boolean functions, in:FCT'83, Springer Lecture Notes in Computer Science158 (1983), 439?444.
Cited by
31 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献