Constant depth circuits, Fourier transform, and learnability-Reference-Cited by-同舟云学术

Constant depth circuits, Fourier transform, and learnability

Published:1993-07 Issue:3 Volume:40 Page:607-620
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Linial Nathan¹,Mansour Yishay²,Nisan Noam³

Affiliation:

1. Hebrew University, Jerusalem,Israel

2. Tel-Aviv University, Tel-Aviv, Israel

3. Hebrew University, Jerusalem, Israel

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference20 articles.

1. E~l-formulae on finite structure;AJTAI M;Ann. Pure Appl. Logic,1983

2. A spectral lower bound technique for the size of decision trees and two-level AND/OR circuits

3. ~DYM H. AND MCKEAN H.P. Fourier Series and httegrals. Academic Press Orlando Fla. ~1972. ~DYM H. AND MCKEAN H.P. Fourier Series and httegrals. Academic Press Orlando Fla. ~1972.

4. and the polynomial-time hierarchy. ~Math;~FURST M.;Syst. Theory,1984

Cited by 326 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case;ACM Transactions on Computation Theory;2024-08-27

2. On the Pauli Spectrum of QAC0;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Learning Shallow Quantum Circuits;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

4. On the Power of Interactive Proofs for Learning;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. Quantum Talagrand, KKL and Friedgut’s Theorems and the Learnability of Quantum Boolean Functions;Communications in Mathematical Physics;2024-04