The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
Ladner, R. E., & Fischer, M. J. (1980) · Journal of the ACM · doi:10.1145/322217.322232 · Cited by 1,281
Chandra, A. K., Kozen, D. C., & Stockmeyer, L. J. (1981) · Journal of the ACM · doi:10.1145/322234.322243 · Cited by 1,221
Parity, circuits, and the polynomial-time hierarchy
Furst, M., Saxe, J. B., & Sipser, M. (1984) · Mathematical Systems Theory · doi:10.1007/bf01744431 · Cited by 938
A taxonomy of problems with fast parallel algorithms
Cook, S. A. (1985) · Information and Control · doi:10.1016/s0019-9958(85)80041-3 · Cited by 641
∑11-Formulae on finite structures
Ajtai, M. (1983) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(83)90038-6 · Cited by 585
Chandra, A. K., Stockmeyer, L. J., & Vishkin, U. (1984) · SIAM Journal on Computing · doi:10.1137/0213028 · Cited by 311
Computational Work and Time on Finite Machines
Savage, J. E. (1972) · Journal of the ACM · doi:10.1145/321724.321731 · Cited by 105
A complexity theory based on Boolean algebra
Skyum, S., & Valiant, L. G. (1985) · Journal of the ACM · doi:10.1145/3149.3158 · Cited by 103
Structure in Complexity Theory
(1986) · Lecture notes in computer science · doi:10.1007/3-540-16486-3 · Cited by 71
Cited by
A Catalog of Complexity Classes
JOHNSON, D. S. (1990) · Algorithms and Complexity · doi:10.1016/b978-0-444-88071-0.50007-2 · Cited by 556
Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
Goldreich, O., Micali, S., & Wigderson, A. (1986) · 27th Annual Symposium on Foundations of Computer Science (sfcs 1986) · doi:10.1109/sfcs.1986.47 · Cited by 549
Lattice-based FHE as secure as PKE
Brakerski, Z., & Vaikuntanathan, V. (2014) · Proceedings of the 5th conference on Innovations in theoretical computer science · doi:10.1145/2554797.2554799 · Cited by 266
Threshold circuits of bounded depth
Hajnal, A., Maass, W., Pudlák, P., Szegedy, M., & Turán, G. (1993) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(93)90001-d · Cited by 237
Computing Algebraic Formulas Using a Constant Number of Registers
Ben-Or, M., & Cleve, R. (1992) · SIAM Journal on Computing · doi:10.1137/0221006 · Cited by 139
Metadata
- Authors
- Barrington, D. A.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1989-02
- Volume
- 38
- Issue
- 1
- Pages
- 150-164
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W4240781210
- Cited by
- 411
- References
- 12
- FWCI
- 11.43
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. https://app.cochat.ai/papers/10.1016/0022-0000(89)90037-8
- The paper
- Barrington, D. A. (1989). Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Journal of Computer and System Sciences. https://doi.org/10.1016/0022-0000(89)90037-8
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.