Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Mix Barrington, D.: Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1. J. Comp. Syst. Sci. 38, 150–164 (1989)
2. Mix Barrington, D., Compton, K., Straubing, H., Thérien, D.: Regular Languages in NC1. J. Comp. Syst. Sci. 44, 478–499 (1992)
3. Mix Barrington, D., Immerman, N., Straubing, H.: On Uniformity in NC1. J. Comp. Syst. Sci. 41, 274–306 (1990)
4. Barrington, D.M., Immerman, N., Lautemann, C., Schweikardt, N., Thérien, D.: The Crane Beach Conjecture. In: LICS 2001, pp. 187–196 (2001)
5. Mix Barrington, D., Straubing, H.: Superlinear Lower Bounds for Bounded- Width Branching Programs. J. Comp. Syst. Sci. 50, 374–381 (1995)