By Topic

Learnability beyond AC0

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
J. C. Jackson ; Duquesne Univ., Pittsburgh, PA, USA ; A. R. Klivans ; R. A. Servedio

We give an algorithm for learning a more expressive circuit class than the class AC0 considered by Linial et al. (1993) and Kharitonov (1993). The new algorithm learns constant-depth AND/OR/NOT circuits augmented with (a limited number of) majority gates. Our main positive result for these circuits is stated informally

Published in:

Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on

Date of Conference: