Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. F. Ablayev, Lower bounds for one-way probabilistic communication complexity and their application to space complexity, Theoretical Computer Science, 157, (1996), 139–159.
2. F. Ablayev and M. Karpinski, On the power of randomized branching programs, in Proceedings of the ICALP'96, Lecture Notes in Computer Science, Springer-Verlag, 1099, (1996), 348–356.
3. F. Ablayev and M. Karpinski, On the power of randomized branching programs, manuscript (generalization of ICALP'96 paper results for the case of pure boolean function), available at http://www.ksu.ru/∼ablayev
4. R. Bryant, Symbolic boolean manipulation with ordered binary decision diagrams, ACM Computing Surveys, 24, No. 3, (1992), 293–318.
5. A. Borodin, A. Razborov, and R. Smolensky, On lower bounds for read-k-times branching programs, Computational Complexity, 3, (1993), 1–18.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献