The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Constant depth circuits, Fourier transform, and learnability
Open accessAbstract
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube.The main result is that an ACO Boolean function has almost all of its "power spectrum" on the low-order coefficients.An important ingredient of the proof is Hastad's switching lemma [8].This result implies several new properties of functions in -4C[': Functions in AC() have low "average sensitivity;" they may be approximated well by a real polynomial of low degree and they cannot be pseudorandom function generators.Perhaps the most interesting application is an O(n POIYIOg(n ')-time algorithm for learning functions in ACO.The algorithm observes the behavior of an AC'" function on O(nPO'Y'Og(n)) randomly chosen inputs, and derives a good approximation for the Fourier transform of the function.This approximation allows the algorithm to predict, with high probability, the value of the function on other randomly chosen inputs.
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
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
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
Theory and application of trapdoor functions
Yao, A. C.-C. (1982) · doi:10.1109/sfcs.1982.95 · Cited by 1,008
Parity, circuits, and the polynomial-time hierarchy
Furst, M., Saxe, J. B., & Sipser, M. (1984) · Mathematical Systems Theory · doi:10.1007/bf01744431 · Cited by 938
Rivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
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
Nisan, N., & Wigderson, A. (1994) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(05)80043-1 · Cited by 808
Self-citationCryptographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. (1994) · Journal of the ACM · doi:10.1145/174644.174647 · Cited by 733
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
Self-citation∑11-Formulae on finite structures
Ajtai, M. (1983) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(83)90038-6 · Cited by 585
Separating the polynomial-time hierarchy by oracles
Yao, A. C.-C. (1985) · 26th Annual Symposium on Foundations of Computer Science (sfcs 1985) · doi:10.1109/sfcs.1985.49 · Cited by 548
(1949) · Pure and Applied Mathematics · doi:10.1016/s0079-8169(08)60767-9 · Cited by 524
A guided tour of chernoff bounds
Hagerup, T., & Rüb, C. (1990) · Information Processing Letters · doi:10.1016/0020-0190(90)90214-i · Cited by 524
Computational limitations of small-depth circuits
Håstad, J. (1987) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 465
Crytographic limitations on learning Boolean formulae and finite automata
Kearns, M., & Valiant, L. G. (1989) · Proceedings of the twenty-first annual ACM symposium on Theory of computing - STOC '89 · doi:10.1145/73007.73049 · Cited by 266
Approximate inclusion-exclusion
Linial, N., & Nisan, N. (1990) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/100216.100250 · Cited by 65
Self-citationValiant, L. G. (2026) · Foundations of Computation and Machine Learning · doi:10.1145/3749740.3749746
Cited by
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
(2007) · Cited by 937
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
Why and when can deep-but not shallow-networks avoid the curse of dimensionality: A review
Poggio, T., Mhaskar, H., Rosasco, L., Miranda, B., & Liao, Q. (2017) · International Journal of Automation and Computing · doi:10.1007/s11633-017-1054-2 · Cited by 559
Metadata
- Authors
- Linial, N., Mansour, Y., & Nisan, N.
- Venue
- Journal of the ACM
- Published
- 1993-07
- Volume
- 40
- Issue
- 3
- Pages
- 607-620
- ISSN
- 0004-5411 (ISSN-L)
- 1557-735X
- OpenAlex
- W2042194938
- Cited by
- 572
- References
- 17
- FWCI
- 9.03
- Type
- journal article
- 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
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.