Author： Kleine Büning Hans Subramani K. Zhao Xishun
Publisher： Springer Publishing Company
ISSN： 0168-7433
Source： Journal of Automated Reasoning, Vol.39, Iss.1, 2007-07, pp. : 49-75
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
A Dichotomy Theorem for Learning Quantified Boolean Formulas
By Dalmau V.
Machine Learning, Vol. 35, Iss. 3, 1999-06 ,pp. :
Access to resources
Recommend
Tree-shellability of Boolean functions
By Takenaga Y. Nakajima K. Yajima S.
Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. :
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. :
Decision tree approximations of Boolean functions
By Mehta
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Decision lists and related Boolean functions
By Eiter T. Ibaraki T. Makino K.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :