Learnability beyond AC/sup 0/

Proceedings 17th IEEE Annual Conference on Computational Complexity Pub Date : 2002-08-07 DOI:10.1109/CCC.2002.1004335

J. C. Jackson, Adam R. Klivans, R. Servedio

引用次数: 1

Abstract

We give an algorithm for learning a more expressive circuit class than the class AC/sup 0/ 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.

查看原文本刊更多论文

可学习性超过AC/sup 0/

我们给出了一种算法，用于学习比Linial等人(1993)和Kharitonov(1993)所考虑的AC/sup 0/类更具表现力的电路类。新算法学习具有(有限数量)多数门的恒深与/或/非电路。我们对这些电路的主要积极结果非正式地陈述。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Proceedings 17th IEEE Annual Conference on Computational Complexity

自引率

0.00%

发文量