Author:
Kriegel Klaus,Waack Stephan
Subject
Computer Science Applications,General Mathematics,Software
Reference13 articles.
1. 1. AJTAI M., BABAI L., HAJNAL P., KOMLOS J., PUDLAK P., RÖDEL V., SZEMEREDI E. and TURAN G., Two lower bounds for branching programs, 18th ACM STOC, 1986, pp. 30-39.
2. 2. BORODIN A., DOLEV D., FICH F. E. and PAUL W., Bounds for width two branching programs, 15th ACM STOC, 1983, pp. 87-93.0589.68034
3. 3. BUDACH L., Lower bounds for the number of nodes in a decision tree, EIK 21, 1985, No 4/5, pp.221-228.824578
4. 4. CHANDRA A. K., FURST M. L. and LIPTON R. J., Multiparty protocols, 15th ACM STOC, 1983, pp.94-99.
5. 5. DUNNE P. E., Lower bounds on the complexity of 1-time-only branching programs, FCT Proc., Lect. Notes in Comp. Sci.,Vol. 199, 1985, pp. 90-99.8212280575.68064
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献