Author： Eiter T. Ibaraki T. Makino K.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.270, Iss.1, 2002-01, pp. : 493-524
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
Decision tree approximations of Boolean functions
By Mehta
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
Access to resources
Recommend
On the size of binary decision diagrams representing Boolean functions
By Breitbart Y. Hunt H. Rosenkrantz D.
Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. :
Decision procedures for inductive Boolean functions based on alternating automata
By Ayari A. Basin D. Klaedtke F.
Theoretical Computer Science, Vol. 300, Iss. 1, 2003-05 ,pp. :
By Rivest R.L.
Machine Learning, Vol. 02, Iss. 3, 1987-11 ,pp. :