Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\)

DOI10.1007/BF01206321zbMath0852.68030MaRDI QIDQ1918950

Sitharam, Meera

Publication date: 23 July 1996

Published in: Computational Complexity (Search for Journal in Brave)

zbMATH Keywords

learning algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Pseudo-Derandomizing Learning and Approximation

Cites Work

• Approximate inclusion-exclusion
• Parity, circuits, and the polynomial-time hierarchy
• Harmonic Analysis of Polynomial Threshold Functions
• On the Power of Threshold Circuits with Small Weights
• Polynomial Threshold Functions, $AC^0 $ Functions, and Spectral Norms
• Learning Decision Trees Using the Fourier Spectrum
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudorandom generators and learning algorithms for \(\mathrm{AC}^ 0\)