To the problem of expressibility in the algebra of partial Boolean functions

ISSN： 0032-9460

Source： Problems of Information Transmission, Vol.41, Iss.1, 2005-01, pp. : 59-64

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

Deciding Boolean Algebra with Presburger Arithmetic

By Kuncak Viktor Nguyen Huu Rinard Martin

Journal of Automated Reasoning, Vol. 36, Iss. 3, 2006-04 ,pp. : 213-239

Springer Publishing Company

Access to resources Recommend Favorite

Tree-shellability of Boolean functions

By Takenaga Y. Nakajima K. Yajima S.

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 633-647

Elsevier

Access to resources Recommend Favorite

Horn functions and submodular Boolean functions

By Ekin O. Hammer P.L. Peled U.N.

Theoretical Computer Science, Vol. 175, Iss. 2, 1997-04 ,pp. : 257-270

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

Boolean Functions as Models for Quantified Boolean Formulas

By Kleine Büning Hans Subramani K. Zhao Xishun

Journal of Automated Reasoning, Vol. 39, Iss. 1, 2007-07 ,pp. : 49-75

Springer Publishing Company

Access to resources Recommend Favorite