Author:
Ďuriš Pavol,Hromkovič Juraj,Jukna Stasys,Sauerhoff Martin,Schnitger Georg
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference27 articles.
1. M. Ajtai, A non-linear time lower bound for boolean branching programs, in: Proceedings of 40th FOCS, 1999, pp. 60–70
2. M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Pudlák, V. Rödl, E. Szemerédi, G. Turán, Two lower bounds for branching programs, in: Proceedings of 18th STOC, 1986, pp. 30–38
3. Meanders and their applications in lower bounds arguments;Alon;Journal of Computer and System Sciences,1988
4. Time-space tradeoffs for branching programs;Beame;Journal of Computer and System Sciences,2001
5. Time-space trade-off lower bounds for randomized computation of decision problems;Beame;Journal of the ACM,2003
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献