Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. M. Ajtai and M. Ben-Or. A theorem on probabilistic constant depth computations. In ACM Symposium on Theory of Computing (STOC’ 84), pages 471–474, 1984. ACM Press.
2. E. Allender, D. A. Mix Barrington, and W. Hesse. Uniform circuits for division: Consequences and problems. To appear in Proceedings of the 16th Annual IEEE Conference on Computational Complexity (CCC-2001), 2001. IEEE Computer Society.
3. D. A. M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274–306, 1990.
4. P. W. Beame, S. A. Cook, and H. J. Hoover. Log depth circuits for division and related problems. SIAM Journal on Computing, 15(4):994–1003, 1986.
5. A. Chiu, G. Davida, and B. Litow. NC1 division. online at
http://www.cs.jcu.edu.au/~bruce/papers/crr00_3.ps.gz
.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Are Targeted Messages More Effective?;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. What Formal Languages Can Transformers Express? A Survey;Transactions of the Association for Computational Linguistics;2024
3. The Descriptive Complexity of Graph Neural Networks;2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2023-06-26
4. The Parallelism Tradeoff: Limitations of Log-Precision Transformers;Transactions of the Association for Computational Linguistics;2023
5. Parallel complexity for nilpotent groups;International Journal of Algebra and Computation;2022-04-18