SIGN IN
SIGN UP
Constant depth circuits, Fourier transform, and learnability
Full Text:
PDF
Buy this Article
Authors:
Nathan Linial
Hebrew University, Jerusalem,Israel
Yishay Mansour
Tel-Aviv University, Tel-Aviv, Israel
Noam Nisan
Hebrew University, Jerusalem, Israel
Published in:
· Journal
Journal of the ACM (JACM)
JACM Homepage
archive
Volume 40 Issue 3, July 1993
Pages 607-620
ACM
New York, NY
, USA
table of contents
doi>
10.1145/174130.174138
1993 Article
Bibliometrics
· Downloads (6 Weeks): 8
· Downloads (12 Months): 67
· Downloads (cumulative): 1,559
· Citation Count: 109
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
ac
0
circuits
algorithms
approximation
boolean functions
complexity
computation of transforms
computations on polynomials
concept learning
harmonic analysis learning
probabilistic algorithms
probabilistic computation
theory
verification
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder