Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference12 articles.
1. 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: Proc. 18th Annual ACM Symp. on Theory of Computing, May 1986, pp. 30–38
2. D. Barrington, Width-3 permutation branching programs, Technical Memo MIT/LCS/TM-293, Massachusetts Institute of Technology, Laboratory for Computer Science, 1985
3. D. Barrington, Bounded-width polynomial-size branching programs recognize exactly those languages in NC1, in: Proc. 18th Annual ACM Symp. on Theory of Computing, 1986, pp. 1–5
4. Bounded-width polynomial-size branching programs recognize exactly those languages in NC1;Barrington;J. Comput. System Sci.,1989
5. Superlinear lower bounds for bounded-width branching programs;Barrington;J. Comput. System Sci.,1995
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Skew circuits of small width;Theoretical Computer Science;2020-06
2. Skew Circuits of Small Width;Lecture Notes in Computer Science;2015