Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Babai, L., Hajnal, P., Szemerédi, E., Turán, G.: A lower bound for read-once only branching programs. Journal of Computer and System Sciences 35 (1987) 153–162
2. Kriegel, K., Waack, S.: Lower bounds on the complexity of real-time branching programs. RAIRO — Theoretical Informatics and Applications 22 (1988) 447–459.
3. Masek, W.: A fast algorithm for the string editing problem and decision graph complexity. M. Sc. Thesis, MIT (1976)
4. Savický, P., Žák, S.: A large lower bound for 1-branching programs. ECCC report 96-036 (1996)
5. Savický, P., Žák, S.: A read-once lower bound and (1,+k)-hierarchy for branching programs. Theoretical Computer Science 238(1–2) (2000) 347–362
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献