Author: Cori R. Schaeffer G.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.292, Iss.1, 2003-01, pp. : 165-183
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
Algorithms for Testing Satisfiability Formulas
By Vlada M.
Artificial Intelligence Review, Vol. 15, Iss. 3, 2001-05 ,pp. :
Exact Learning of Formulas in Parallel
By Bshouty N.H.
Machine Learning, Vol. 26, Iss. 1, 1997-01 ,pp. :
Learnability of quantified formulas
Theoretical Computer Science, Vol. 306, Iss. 1, 2003-09 ,pp. :
By Gama João
Machine Learning, Vol. 55, Iss. 3, 2004-06 ,pp. :
By Giammarresi D. Mantaci S. Mignosi F. Restivo A.
Theoretical Computer Science, Vol. 205, Iss. 1, 1998-08 ,pp. :