The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Relational queries computable in polynomial time
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
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
Introduction to Database Systems
(2006) · Foundations of Database Design · doi:10.1201/9781420003345.ch1 · Cited by 3,521
A Mathematical Introduction to Logic
(2001) · Elsevier eBooks · doi:10.1016/c2009-0-22107-6 · Cited by 2,387
Generalized first-order spectra and polynomial-time recognizable sets
Fagin, R. (1974) · Medical Entomology and Zoology · Cited by 828
Elementary Induction on Abstract Structures
(1974) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)x7092-2 · Cited by 492
Computable queries for relational data bases
chandra, A. K., & Harel, D. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90032-x · Cited by 437
Upper and lower bounds for first order expressibility
Immerman, N. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90011-3 · Cited by 263
Self-citationParity, circuits, and the polynomial-time hierarchy
Furst, M., Saxe, J. B., & Sipser, M. (1981) · 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981) · doi:10.1109/sfcs.1981.35 · Cited by 212
Number of quantifiers is better than number of tape cells
Immerman, N. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90039-8 · Cited by 174
Self-citationLanguages which capture complexity classes
Immerman, N. (1983) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800061.808765 · Cited by 113
Self-citation
Cited by
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
Complexity and expressive power of logic programming
Dantsin, E., Eiter, T., Gottlob, G., & Voronkov, A. (2001) · ACM Computing Surveys · doi:10.1145/502807.502810 · Cited by 739
An optimal lower bound on the number of variables for graph identification
Cai, J.-Y., F�rer, M., & Immerman, N. (1992) · Combinatorica · doi:10.1007/bf01305232 · Cited by 502
Self-citationHorn clause queries and generalizations
Chandra, A. K., & Harel, D. (1985) · The Journal of Logic Programming · doi:10.1016/0743-1066(85)90002-0 · Cited by 309
Elements of Relational Database Theory
KANELLAKIS, P. C. (1990) · Formal Models and Semantics · doi:10.1016/b978-0-444-88074-1.50022-6 · Cited by 259
Metadata
- Authors
- Immerman, N.
- Venue
- Information and Control
- Publisher
- Elsevier BV
- Published
- 1986-01
- Volume
- 68
- Issue
- 1-3
- Pages
- 86-104
- ISSN
- 0019-9958 (ISSN-L)
- OpenAlex
- W2088094394
- Cited by
- 643
- References
- 11
- FWCI
- 23.99
- 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: Relational queries computable in polynomial time. https://app.cochat.ai/papers/10.1016/s0019-9958(86)80029-8
- The paper
- Immerman, N. (1986). Relational queries computable in polynomial time. Information and Control. https://doi.org/10.1016/s0019-9958(86)80029-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.