@article{BARRINGTON1989150,
    Abstract = {We show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be recognized by a width-5 polynomial-size branching program. As any bounded-width polynomial-size branching program can be simulated by an NC1 circuit, we have that the class of languages recognized by such programs is exactly nonuniform NC1. Further, following Ruzzo (J. Comput. System Sci. 22 (1981), 365--383) and Cook (Inform. and Control 64 (1985) 2--22), if the branching programs are restricted to be ATIME(logn)-uniform, they recognize the same languages as do ATIME(log n)-uniform NC1 circuits, that is, those languages in ATIME(log n). We also extend the method of proof to investigate the complexity of the word problem for a fixed permutation group and show that polynomial size circuits of width 4 also recognize exactly nonuniform NC1.},
    Author = {Barrington, David A.},
    File = {Bounded-width polynomial-size branching programs - 1-s2.0-0022000089900378-main.pdf},
    ISSN = {0022-0000},
    Journal = {Journal of Computer and System Sciences},
    Number = {1},
    Pages = {150-164},
    Title = {Bounded-width polynomial-size branching programs recognize exactly those languages in NC1},
    URL = {https://www.sciencedirect.com/science/article/pii/0022000089900378},
    Volume = {38},
    Year = {1989},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/0022000089900378},
    bdsk-url-2 = {https://doi.org/10.1016/0022-0000(89)90037-8},
    date-added = {2022-08-10 13:19:59 +0200},
    date-modified = {2022-08-10 13:19:59 +0200},
    doi = {10.1016/0022-0000(89)90037-8}
}

@article{BARRINGTON1989150, Abstract = {We show that any language recognized by an NC1 circuit (fan-in 2, depth O(log n)) can be recognized by a width-5 polynomial-size branching program. As any bounded-width polynomial-size branching program can be simulated by an NC1 circuit, we have that the class of languages recognized by such programs is exactly nonuniform NC1. Further, following Ruzzo (J. Comput. System Sci. 22 (1981), 365--383) and Cook (Inform. and Control 64 (1985) 2--22), if the branching programs are restricted to be ATIME(logn)-uniform, they recognize the same languages as do ATIME(log n)-uniform NC1 circuits, that is, those languages in ATIME(log n). We also extend the method of proof to investigate the complexity of the word problem for a fixed permutation group and show that polynomial size circuits of width 4 also recognize exactly nonuniform NC1.}, Author = {Barrington, David A.}, File = {Bounded-width polynomial-size branching programs - 1-s2.0-0022000089900378-main.pdf}, ISSN = {0022-0000}, Journal = {Journal of Computer and System Sciences}, Number = {1}, Pages = {150-164}, Title = {Bounded-width polynomial-size branching programs recognize exactly those languages in NC1}, URL = {https://www.sciencedirect.com/science/article/pii/0022000089900378}, Volume = {38}, Year = {1989}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/0022000089900378}, bdsk-url-2 = {https://doi.org/10.1016/0022-0000(89)90037-8}, date-added = {2022-08-10 13:19:59 +0200}, date-modified = {2022-08-10 13:19:59 +0200}, doi = {10.1016/0022-0000(89)90037-8} }