The DOI matches its Crossref record.
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Abstract
Article Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 Share on Author: D A Barrington Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MA Department of Mathematics, Massachusetts Institute of Technology, Cambridge, MAView Profile Authors Info & Claims STOC '86: Proceedings of the eighteenth annual ACM symposium on Theory of computingNovember 1986 Pages 1–5https://doi.org/10.1145/12130.12131Online:01 November 1986Publication History 113citation1,087DownloadsMetricsTotal Citations113Total Downloads1,087Last 12 Months19Last 6 weeks3 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Overview
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
Cited by
Fully homomorphic encryption using ideal lattices
Gentry, C. (2009) · Proceedings of the forty-first annual ACM symposium on Theory of computing · doi:10.1145/1536414.1536440 · Cited by 6,806
Goldreich, O., Micali, S., & Wigderson, A. (1987) · Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87 · doi:10.1145/28395.28420 · Cited by 3,590
Founding crytpography on oblivious transfer
Kilian, J. (1988) · Proceedings of the twentieth annual ACM symposium on Theory of computing - STOC '88 · doi:10.1145/62212.62215 · Cited by 1,018
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
Implicit Language Models are RNNs: Balancing Parallelization and Expressivity
Schöne, M., Rahmani, B., Kremer, H., Falck, F., Ballani, H., & Gladrow, J. (2025) · arXiv · doi:10.48550/arxiv.2502.07827
“A hard state tracking problem in the sense that all state tracking problems can be reduced to it is given by the word problem for the symmetric group S 5 (Barrington, 1989).”
Metadata
- Authors
- Barrington, D. A.
- Venue
- Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
- Publisher
- ACM Press
- Published
- 1986
- Pages
- 1-5
- OpenAlex
- W2104952158
- Cited by
- 669
- References
- 0
- FWCI
- 13.82
- Type
- conference paper
- Language
- en
- Open access
- closed
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.1145/12130.12131
- The paper
- Barrington, D. A. (1986). Bounded-width polynomial-size branching programs recognize exactly those languages in NC1. Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86. https://doi.org/10.1145/12130.12131
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.