The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
The circuit value problem is log space complete for P
Abstract
article The circuit value problem is log space complete for P Share on Author: Richard E. Ladner University of Washington, Seattle, Washington 98195 University of Washington, Seattle, Washington 98195View Profile Authors Info & Claims ACM SIGACT NewsVolume 7Issue 1January 1975 pp 18–20https://doi.org/10.1145/990518.990519Online:01 January 1975Publication History 233citation811DownloadsMetricsTotal Citations233Total Downloads811Last 12 Months31Last 6 weeks9 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
Cites
An observation on time-storage trade off
Cook, S. A. (1973) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800125.804032 · Cited by 77
Complete problems for deterministic polynomial time
Jones, N. D., & Laaser, W. T. (1974) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800119.803883 · Cited by 41
Cited by
The complexity of relational query languages (Extended Abstract)
Vardi, M. Y. (1982) · Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82 · doi:10.1145/800070.802186 · Cited by 1,184
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
Simple Local Search Problems that are Hard to Solve
Schäffer, A. A. (1991) · SIAM Journal on Computing · doi:10.1137/0220004 · Cited by 291
The complexity of combinatorial problems with succinct input representation
Wagner, K. W. (1986) · Acta Informatica · doi:10.1007/bf00289117 · Cited by 285
The Parallelism Tradeoff: Limitations of Log-Precision Transformers
Merrill, W., & Sabharwal, A. (2023) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00562 · Cited by 22
Metadata
- Authors
- Ladner, R. E.
- Venue
- ACM SIGACT News
- Published
- 1975-01
- Volume
- 7
- Issue
- 1
- Pages
- 18-20
- ISSN
- 0163-5700 (ISSN-L)
- OpenAlex
- W2088956149
- Cited by
- 306
- References
- 2
- FWCI
- 3.17
- Type
- journal article
- 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: The circuit value problem is log space complete for P. https://app.cochat.ai/papers/10.1145/990518.990519
- The paper
- Ladner, R. E. (1975). The circuit value problem is log space complete for P. ACM SIGACT News. https://doi.org/10.1145/990518.990519
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.