The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
On the degree of boolean functions as real polynomials
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
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Schwartz, J. T. (1980) · Journal of the ACM · doi:10.1145/322217.322225 · Cited by 1,701
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
The influence of variables on Boolean functions
Kahn, J., Kalai, G., & Linial, N. (1988) · [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21923 · Cited by 620
Learning decision trees using the Fourier spectrum
Kushilevitz, E., & Mansour, Y. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103466 · Cited by 139
Schwankung von Polynomen zwischen Gitterpunkten
Ehlich, H., & Zeller, K. (1964) · Mathematische Zeitschrift · doi:10.1007/bf01111276 · Cited by 136
Constant depth circuits, Fourier transform, and learnability
Linial, N., Mansour, Y., & Nisan, N. (1989) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1989.63537 · Cited by 126
Self-citationPolynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms
Bruck, J., & Smolensky, R. (1992) · SIAM Journal on Computing · doi:10.1137/0221003 · Cited by 120
Nisan, N. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73038 · Cited by 84
Self-citationThe expressive power of voting polynomials
Aspnes, J., Beigel, R., Furst, M., & Rudich, S. (1991) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/103418.103461 · Cited by 70
A Comparison of Uniform Approximations on an Interval and a Finite Subset Thereof
Rivlin, T. J., & Cheney, E. W. (1966) · SIAM Journal on Numerical Analysis · doi:10.1137/0703024 · Cited by 60
Cited by
O'Donnell, R. (2014) · Cambridge University Press eBooks · doi:10.1017/cbo9781139814782 · Cited by 932
Boolean Functions for Cryptography and Error-Correcting Codes
Carlet, C. (2010) · Boolean Models and Methods in Mathematics, Computer Science, and Engineering · doi:10.1017/cbo9780511780448.011 · Cited by 847
Complexity measures and decision tree complexity: a survey
Buhrman, H., & de Wolf, R. (2002) · Theoretical Computer Science · doi:10.1016/s0304-3975(01)00144-x · Cited by 665
Quantum lower bounds by polynomials
Beals, R., Buhrman, H., Cleve, R., Mosca, M., & de Wolf, R. (2001) · Journal of the ACM · doi:10.1145/502090.502097 · Cited by 639
Model complexity of deep learning: a survey
Hu, X., Chu, L., Pei, J., Liu, W., & Bian, J. (2021) · Knowledge and Information Systems · doi:10.1007/s10115-021-01605-0 · Cited by 402
Metadata
- Authors
- Nisan, N., & Szegedy, M.
- Venue
- Computational Complexity
- Published
- 1994-12
- Volume
- 4
- Issue
- 4
- Pages
- 301-313
- ISSN
- 1016-3328 (ISSN-L)
- 1420-8954
- OpenAlex
- W1969865855
- Cited by
- 384
- References
- 10
- FWCI
- 2.91
- Type
- journal article
- 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.