Decision procedures for inductive Boolean functions based on alternating automata

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.

Previous Menu Next

Abstract

Related content

Decision tree approximations of Boolean functions

By Mehta  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 609-623

Elsevier

Access to resources Recommend Favorite

Decision lists and related Boolean functions

By Eiter T.   Ibaraki T.   Makino K.  

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 493-524

Elsevier

Access to resources Recommend Favorite

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. : 45-69

Elsevier

Access to resources Recommend Favorite

Alternating and empty alternating auxiliary stack automata

By Holzer M.   McKenzie P.  

Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. : 307-326

Elsevier

Access to resources Recommend Favorite

A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions

By Uyanık K.   Turgut S.  

Quantum Information Processing, Vol. 12, Iss. 11, 2013-11 ,pp. : 3395-3409

Springer Publishing Company

Access to resources Recommend Favorite