![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Author: Ayari A. Basin D. Klaedtke F.
Publisher: Elsevier
ISSN: 0304-3975
Source: Theoretical Computer Science, Vol.300, Iss.1, 2003-05, pp. : 301-329
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
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Decision tree approximations of Boolean functions
By Mehta
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Decision lists and related Boolean functions
By Eiter T. Ibaraki T. Makino K.
Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
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. :
![](/images/ico/ico_close.png)
![](/images/ico/ico5.png)
Alternating and empty alternating auxiliary stack automata
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :