Author:
Gál Anna,Koucký Michal,McKenzie Pierre
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference20 articles.
1. Barrington, D., McKenzie, P.: Oracle branching programs and logspace versus P. Inf. Comput. 95, 96–115 (1991)
2. Beame, P., Jayram, T.S., Saks, M.E.: Time–space tradeoffs for branching programs. J. Comput. Syst. Sci. 63(4), 542–572 (2001)
3. Berkowitz, S.J.: On some relationships between monotone and non-monotone circuit complexity. Manuscript, Computer Science Department, University of Toronto (1981)
4. Borodin, A., Cook, S.A.: A time-space trade-off for sorting on a general sequential model of computation. SIAM J. Comput. 11(2), 287–297 (1982)
5. Borodin, A., Razborov, A., Smolensky, R.: On lower bounds for read-k-times branching programs. Comput. Complex. 3, 1–18 (1993)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献