The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Graph-theoretic arguments in low-level complexity
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
nauk, R. A. (1965) · Наука eBooks · Cited by 1,013
Mathematical Theory of Connecting Networks and Telephone Traffic
Mullin, A. A., & Beneš, V. (1966) · Mathematics of Computation · doi:10.2307/2003526 · Cited by 817
The 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
THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
Borodin, A., & Munro, I. (1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 447
SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC
Fischer, M. J., & Rabin, M. O. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_5 · Cited by 331
On the number of multiplications necessary to compute certain functions
Winograd, S. (1970) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160230204 · Cited by 177
Universal circuits (Preliminary Report)
Valiant, L. G. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803649 · Cited by 170
Self-citationDie Berechnungskomplexit�t von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
Strassen, V. (1973) · Numerische Mathematik · doi:10.1007/bf01436566 · Cited by 150
On sparse graphs with dense long paths
Erdős, P., Graham, R. L., & Szemerédi, E. (1975) · Computers & Mathematics with Applications · doi:10.1016/0898-1221(75)90037-1 · Cited by 90
On time versus space and related problems
Hopcroft, J. E., Paul, W. J., & Valiant, L. G. (1975) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1975.23 · Cited by 86
Self-citationOn non-linear lower bounds in computational complexity
Valiant, L. G. (1975) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800116.803752 · Cited by 85
Self-citationShifting Graphs and Their Applications
Pippenger, N. J., & Valiant, L. G. (1976) · Journal of the ACM · doi:10.1145/321958.321962 · Cited by 75
Self-citationSpace bounds for a game on graphs
Paul, W. J., Tarjan, R. E., & Celoni, J. R. (1976) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/800113.803643 · Cited by 51
Circuit size is nonlinear in depth
Paterson, M. S., & Valiant, L. G. (1976) · Theoretical Computer Science · doi:10.1016/0304-3975(76)90090-6 · Cited by 28
Self-citationEhrenfeucht, A. (1975) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(75)80060-2 · Cited by 18
Cited by
Which Problems Have Strongly Exponential Complexity?
Impagliazzo, R., Paturi, R., & Zane, F. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2001.1774 · Cited by 1,331
Applications of a Planar Separator Theorem
Lipton, R. J., & Tarjan, R. E. (1980) · SIAM Journal on Computing · doi:10.1137/0209046 · Cited by 640
Arithmetic Circuits: A Survey of Recent Results and Open Questions
Shpilka, A., & Yehudayoff, A. (2010) · Foundations and Trends® in Theoretical Computer Science · doi:10.1561/0400000039 · Cited by 363
Succinct Non-interactive Arguments via Linear Interactive Proofs
Bitansky, N., Chiesa, A., Ishai, Y., Paneth, O., & Ostrovsky, R. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-36594-2_18 · Cited by 274
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
Klivans, A. R., & van Melkebeek, D. (2002) · SIAM Journal on Computing · doi:10.1137/s0097539700389652 · Cited by 270
Metadata
- Authors
- Valiant, L. G.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1977
- Pages
- 162-176
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1530008367
- Cited by
- 312
- References
- 16
- FWCI
- 3.67
- 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.