On Restricted-Focus-of-Attention Learnability of Boolean Functions

Author： Birkendorf A.  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.30, Iss.1, 1998-01, pp. : 89-123

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

Tree-shellability of Boolean functions

By Takenaga Y.   Nakajima K.   Yajima S.  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 633-647

Elsevier

Access to resources Recommend Favorite

Horn functions and submodular Boolean functions

By Ekin O.   Hammer P.L.   Peled U.N.  

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 257-270

Elsevier

Access to resources Recommend Favorite

Fat-Shattering and the Learnability of Real-Valued Functions

By Bartlett P.L.   Long P.M.   Williamson R.C.  

Journal of Computer and System Sciences, Vol. 52, Iss. 3, 1996-06 ,pp. : 434-452

Academic Press

Access to resources Recommend Favorite

Boolean Functions as Models for Quantified Boolean Formulas

By Kleine Büning Hans   Subramani K.   Zhao Xishun  

Journal of Automated Reasoning, Vol. 39, Iss. 1, 2007-07 ,pp. : 49-75

Springer Publishing Company

Access to resources Recommend Favorite

Decision tree approximations of Boolean functions

By Mehta  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 609-623

Elsevier

Access to resources Recommend Favorite