Author:
Bollig Beate,Waack Stephan,Woelfel Philipp
Reference21 articles.
1. M. Ajtai. A non-linear time lower bound for boolean branching programs. In Proceedings of the 40th Annual IEEE Symposium on Fountations of Computer Science, pp. 60–70. 1999.
2. N. Alon and W. Maass. Meanders and their applications in lower bounds arguments. Journal of Computer and System Sciences, 37: 118–129, 1988.
3. P. Beame, M. Saks, X. Sun, and E. Vee. Super-linear time-space tradeoff lower bounds for randomized computation. In Proceedings of the 41st Annual IEEE Symposium on Fountations of Computer Science, pp. 169–179. 2000.
4. P. Beame and E. Vee. Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing. 2002. To appear.
5. B. Bollig. Restricted nondeterministic read-once branching programs and an exponential lower bound for integer multiplication. RAIRO Theoretical Informatics and Applications, 35: 149–162, 2001.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献