Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 577

The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.

Some connections between nonuniform and uniform complexity classes

Open access
Karp, Richard M., Lipton, Richard J.·1980·Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80

Abstract

It is well known that every set in P has small circuits [13]. Adleman [1] has recently proved the stronger result that every set accepted in polynomial time by a randomized Turing machine has small circuits. Both these results are typical of the known relationships between uniform and nonuniform complexity bounds. They obtain a nonuniform upper bound as a consequence of a uniform upper bound.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/800141.804678

Cites

12 of 12 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 12 references

Cited by

See all 577

Metadata

Authors
Karp, R. M., & Lipton, R. J.
Venue
Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80
Publisher
ACM Press
Published
1980
Pages
302-309
OpenAlex
W1970089350
Cited by
577
References
12
FWCI
7.61
Type
conference paper
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: Some connections between nonuniform and uniform complexity classes. https://app.cochat.ai/papers/10.1145/800141.804678
The paper
Karp, R. M., & Lipton, R. J. (1980). Some connections between nonuniform and uniform complexity classes. Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80. https://doi.org/10.1145/800141.804678

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.