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 accessAbstract
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.
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
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Self-citationThe complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Random walks, universal traversal sequences, and the complexity of maze problems
Aleliunas, R., Karp, R. M., Lipton, R. J., Lovasz, L., & Rackoff, C. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.34 · Cited by 692
Self-citationThe equivalence problem for regular expressions with squaring requires exponential space
Meyer, A. R., & Stockmeyer, L. J. (1972) · 13th Annual Symposium on Switching and Automata Theory (swat 1972) · doi:10.1109/swat.1972.29 · Cited by 596
On Isomorphisms and Density of $NP$ and Other Complete Sets
Berman, L., & Hartmanis, J. (1977) · SIAM Journal on Computing · doi:10.1137/0206023 · Cited by 459
On the complexity of some two-person perfect-information games
Schaefer, T. J. (1978) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(78)90045-4 · Cited by 321
Two theorems on random polynomial time
Adleman, L. (1978) · 19th Annual Symposium on Foundations of Computer Science (sfcs 1978) · doi:10.1109/sfcs.1978.37 · Cited by 316
Relative complexity of checking and evaluating
Valiant, L. G. (1976) · Information Processing Letters · doi:10.1016/0020-0190(76)90097-1 · Cited by 277
Computational Work and Time on Finite Machines
Savage, J. E. (1972) · Journal of the ACM · doi:10.1145/321724.321731 · Cited by 105
Cited by
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Theory and application of trapdoor functions
Yao, A. C. (1982) · 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982) · doi:10.1109/sfcs.1982.45 · Cited by 968
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
Decoding of Reed Solomon Codes beyond the Error-Correction Bound
Sudan, M. (1997) · Journal of Complexity · doi:10.1006/jcom.1997.0439 · Cited by 723
Algebraic methods for interactive proof systems
Lund, C., Fortnow, L., Karloff, H., & Nisan, N. (1992) · Journal of the ACM · doi:10.1145/146585.146605 · Cited by 711
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.