Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference13 articles.
1. M. Ajtai, L. Babai, P. Hajnal, J. Komlós, P. Púdlak, V. Rödl, E. Szemerédi, and G. Turán, Two lower bounds for branching programs,Proc. 18th Ann. ACM Symp. Theory of Computing, 1986, 30?38.
2. J. Bar-Ilan and D. Beaver, Non-cryptographic fault-tolerant computing in constant number of rounds of interaction,Proc. 8th Ann. ACM Symp. Principles of Distributed Computing, 1989, 201?209.
3. D. A. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages inNC 1,J. Computer System Sci.,38 (1989), 150?164.
4. M. Ben-Or and R. Cleve, Computing algebraic formulas using a constant number of registers,Proc. 20th Ann. ACM Symp. Theory of Computing, 1988, 254?257.
5. A. Borodin, D. Dolev, F. Fich, and W. Paul, Bounds for width two branching programs,Proc. 15th Ann. ACM Symp. Theory of Computing, 1983, 87?93.
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献