Large Systems of Boolean Functions: Realization by Modular Arithmetic Methods

ISSN： 0005-1179

Source： Automation and Remote Control, Vol.65, Iss.6, 2004-06, pp. : 871-892

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

Algorithms for Synthesis of Polynomials Implementing Weakly Specified Boolean Functions and Systems

By Zakrevskii A. D.

Automation and Remote Control, Vol. 65, Iss. 6, 2004-06 ,pp. : 978-996

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

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

Modular Forms of Systems of k-valued Functions of the Algebra of Logic

By Fin’ko O.

Automation and Remote Control, Vol. 66, Iss. 7, 2005-07 ,pp. : 1081-1100

MAIK Nauka/Interperiodica

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