## Bounded-width polynomial-size branching programs recognize exactly those languages (1986)

by
A. Barrington

Venue: | in NC’, in “Proceedings, 18th ACM STOC |

Citations: | 208 - 13 self |

### BibTeX

@INPROCEEDINGS{Barrington86bounded-widthpolynomial-size,

author = {A. Barrington},

title = {Bounded-width polynomial-size branching programs recognize exactly those languages},

booktitle = {in NC’, in “Proceedings, 18th ACM STOC},

year = {1986},

pages = {1--5}

}

### Years of Citing Articles

### OpenURL

### Abstract

We show that any language recognized by an NC ’ 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 NC ’ circuit, we have that the class of languages recognized by such programs is exactly nonuniform NC’. Further, following