Author: Dalmau V. Jeavons P.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.306, Iss.1, 2003-09, pp. : 485-511
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
Construction and learnability of canonical Horn formulas
Machine Learning, Vol. 85, Iss. 3, 2011-12 ,pp. :
On the Learnability of Disjunctive Normal Form Formulas
Machine Learning, Vol. 19, Iss. 3, 1995-06 ,pp. :
The learnability of exclusive-or expansions based on monotone DNF formulas
By Takimoto E. Sakai Y. Maruoka A.
Theoretical Computer Science, Vol. 241, Iss. 1, 2000-06 ,pp. :
A Dichotomy Theorem for Learning Quantified Boolean Formulas
By Dalmau V.
Machine Learning, Vol. 35, Iss. 3, 1999-06 ,pp. :