Author:
Jukna Stasys,Žák Stanislav
Publisher
Springer Berlin Heidelberg
Reference8 articles.
1. Dunne, P. E.: Lower bounds on the complexity of one-time-only branching programs. In: Proc. of FCT'85, Lect. Notes in Comput. Sci., 199 (1985), 90–99.
2. Jukna, S.: Entropy of contact circuits and lower bounds on their complexity. Theoret. Comput. Sci., 57 (1988), 113–129.
3. -: A note on read-k-times branching programs. RAIRO Theoretical Informatics and Applications
29:1 (1995), pp. 75–83.
4. -, Razborov, A. A.: Neither reading few bits twice nor reading illegally helps much. ECCC TR96-037 (1996). To appear in: Discrete Appl. Math.
5. Neciporuk, E. I.: On a Boolean function. Soviet Mathematics Doklady
7:4 (1966), 999–1000.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献