Publisher
Springer Berlin Heidelberg
Reference35 articles.
1. Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 157, 139–159 (1996)
2. Lecture Notes in Computer Science;F. Ablayev,1997
3. Lecture Notes in Computer Science;F. Ablayev,1996
4. Ablayev, F., Karpinski, M.: On the Power of Randomized Ordered Branching Programs. Electronic Colloquium on Computational Complexity, TR98-004 (1998), available at http://www.eccc.uni-trier.de/eccc/
5. Ablayev, F., Karpinski, M.: A lower bound for integer multiplication on randomized ordered read-once branching programs. Information and Computation 186(1), 78–89 (2003)