The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
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
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
Smolensky, R. (1987) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/28395.28404 · Cited by 845
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
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
Almost optimal lower bounds for small depth circuits
Hastad, J. (1986) · Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 · doi:10.1145/12130.12132 · Cited by 620
∑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
Separating the polynomial-time hierarchy by oracles
Yao, A. C.-C. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.49 · Cited by 548
Chandra, A. K., Stockmeyer, L. J., & Vishkin, U. (1984) · SIAM Journal on Computing · doi:10.1137/0213028 · Cited by 311
Log Depth Circuits for Division and Related Problems
Beame, P. W., Cook, S. A., & Hoover, H. J. (1986) · SIAM Journal on Computing · doi:10.1137/0215070 · Cited by 242
Parallel computation with threshold functions
Parberry, I., & Schnitger, G. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90030-x · Cited by 109
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
Bounded-depth, polynomial-size circuits for symmetric functions
Fagin, R., Klawe, M. M., Pippenger, N. J., & Stockmeyer, L. J. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90045-3 · Cited by 61
Bounds for Width Two Branching Programs
Borodin, A., Dolev, D., Fich, F. E., et al. (1986) · SIAM Journal on Computing · doi:10.1137/0215040 · Cited by 31
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
The NP-completeness column: An ongoing guide
Johnson, D. S. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90020-9 · Cited by 794
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
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
- 16
- 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
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.