The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A complexity theoretic approach to randomness
Abstract
We study a time bounded variant of Kolmogorov complexity. This notion, together with universal hashing, can be used to show that problems solvable probabilistically in polynomial time are all within the second level of the polynomial time hierarchy. We also discuss applications to the theory of probabilistic constructions.
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
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
Stockmeyer, L. J. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90061-x · Cited by 1,293
On the Length of Programs for Computing Finite Binary Sequences: statistical considerations
Chaitin, G. J. (1969) · Journal of the ACM · doi:10.1145/321495.321506 · Cited by 918
A Theory of Program Size Formally Identical to Information Theory
Chaitin, G. J. (1975) · Journal of the ACM · doi:10.1145/321892.321894 · Cited by 849
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
A Fast Monte-Carlo Test for Primality
Solovay, R., & Strassen, V. (1977) · SIAM Journal on Computing · doi:10.1137/0206006 · Cited by 635
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Karp, R. M. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.209 · Cited by 439
Bennett, C. H., & Gill, J. (1981) · SIAM Journal on Computing · doi:10.1137/0210008 · Cited by 381
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
On the generation of cryptographically strong pseudorandom sequences
Shamir, A. (1983) · ACM Transactions on Computer Systems · doi:10.1145/357353.357357 · Cited by 268
Parity, 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
Self-citationRiemann's Hypothesis and tests for primality
Miller, G. L. (1975) · Proceedings of seventh annual ACM symposium on Theory of computing - STOC '75 · doi:10.1145/800116.803773 · Cited by 186
Probabilistic algorithms in finite fields
Ben-Or, M. (1981) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1981.37 · Cited by 159
On the generation of cryptographically strong pseudo-random sequences
Adi Shamir, Z. (1981) · Lecture notes in computer science · doi:10.1007/3-540-10843-2_43 · Cited by 103
Comparison of Two Pseudo-Random Number Generators
Blum, L., Blum, M., & Shub, M. (1983) · Springer eBooks · doi:10.1007/978-1-4757-0602-4_6 · Cited by 100
ON THE LENGTH OF PROGRAMS FOR COMPUTING FINITE BINARY SEQUENCES
Chaitin, G. J. (1987) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789814434058_0019 · Cited by 81
An information-theoretic approach to time bounds for on-line computation
Paul, W. J., Seiferas, J., & Šimon, J. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90009-x · Cited by 79
Why and how to establish a private code on a public network
Goldwasser, S., Micali, S. M., & Tong, P. (1982) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1982.100 · Cited by 79
Meyer, A. R., & McCreight, E. M. (1971) · Elsevier eBooks · doi:10.1016/b978-0-12-417750-5.50006-3 · Cited by 32
On the inference of optimal descriptions
Daley, R. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90015-9 · Cited by 21
An information-theoretic approach to time bounds for on-line computation (preliminary version)
Paul, W. J., Seiferas, J., & Šimon, J. (1980) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800141.804685 · Cited by 15
Succinct representation random strings, and complexity classes
Peterson, G. L. (1980) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1980.42 · Cited by 11
Cited by
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
A Pseudorandom Generator from any One-way Function
HÅstad, J., Impagliazzo, R., Levin, L. A., & Luby, M. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539793244708 · Cited by 1,653
Random generation of combinatorial structures from a uniform distribution
Jerrum, M. R., Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90174-x · Cited by 985
Nisan, N., & Wigderson, A. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80043-1 · Cited by 808
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
Metadata
- Authors
- Sipser, M.
- Venue
- Proceedings of the fifteenth annual ACM symposium on Theory of computing - STOC '83
- Publisher
- ACM Press
- Published
- 1983
- Pages
- 330-335
- OpenAlex
- W2131798840
- Cited by
- 460
- References
- 22
- FWCI
- 9.99
- 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.