On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.137, Iss.1, 1995-01, pp. : 109-127

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Self-Directed Learning and Its Relation to the VC-Dimension and to Teacher-Directed Learning

By Ben-David S.

Machine Learning, Vol. 33, Iss. 1, 1998-10 ,pp. : 87-104

Springer Publishing Company

Access to resources Recommend Favorite

On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In

By Turan G. Vatan F.

Journal of Computer and System Sciences, Vol. 54, Iss. 1, 1997-02 ,pp. : 199-212

Academic Press

Access to resources Recommend Favorite

Bounds on the Sample Complexity of Bayesian Learning Using Information Theory and the VC Dimension

By Haussler D.

Machine Learning, Vol. 14, Iss. 1, 1994-01 ,pp. : 83-113

Springer Publishing Company

Access to resources Recommend Favorite

Cryptographically significant Boolean functions with five valued Walsh spectra

By Maitra S. Sarkar P.

Theoretical Computer Science, Vol. 276, Iss. 1, 2002-04 ,pp. : 133-146

Elsevier

Access to resources Recommend Favorite

On the computational power of depth-2 circuits with threshold and modulo gates

By Krause M. Pudlak P.

Theoretical Computer Science, Vol. 174, Iss. 1, 1997-03 ,pp. : 137-156

Elsevier

Access to resources Recommend Favorite