The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
On span programs
Abstract
A linear algebraic model of computation the span program, is introduced, and several upper and lower bounds on it are proved. These results yield applications in complexity and cryptography. The proof of the main connection, between span programs and counting branching programs, uses a variant of Razborov's general approximation method.>
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
Shamir, A. (1979) · Communications of the ACM · doi:10.1145/359168.359176 · Cited by 13,756
Handbook of theoretical computer science
Leeuwen, J. V. (1990) · Medical Entomology and Zoology · Cited by 4,259
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
Smolensky, R. (1987) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/28395.28404 · Cited by 845
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
NP is as easy as detecting unique solutions
Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90135-0 · Cited by 635
On the computational power of PP and (+)P
Toda, S. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63527 · Cited by 243
Two remarks on the power of counting
Papadimitriou, C. H., & Zachos, S. K. (2006) · Springer eBooks · doi:10.1007/bfb0036487 · Cited by 209
Structure and importance of logspace-MOD class
Buntrock, G., Damm, C., Hertrampf, U., & Meinel, C. (1992) · Theory of Computing Systems · doi:10.1007/bf01374526 · Cited by 122
On the construction of parallel computers from various bases of boolean functions
Goldschlager, L. M., & Parberry, I. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90165-9 · Cited by 90
Cited by
Secure Multiparty Computation and Secret Sharing
Cramer, R., Damgård, I. B., & Nielsen, J. B. (2015) · doi:10.1017/cbo9781107337756 · Cited by 595
A Simple Publicly Verifiable Secret Sharing Scheme and Its Application to Electronic Voting
Schoenmakers, B. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_10 · Cited by 448
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
Cramer, R., Dodis, Y., Fehr, S., Padró, C., & Wichs, D. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_27 · Cited by 259
Lenstra, A. K., Kleinjung, T., & Thomé, E. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-42001-6_9 · Cited by 13
Metadata
- Authors
- Karchmer, M., & Wigderson, A.
- Venue
- [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-30
- Pages
- 102-111
- OpenAlex
- W2120551550
- Cited by
- 486
- References
- 9
- FWCI
- 14.04
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On span programs. https://app.cochat.ai/papers/10.1109/sct.1993.336536
- The paper
- Karchmer, M., & Wigderson, A. (2002). On span programs. [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference. https://doi.org/10.1109/sct.1993.336536
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.
