Computational methods in discrete mathematics

Algorithm for searching prohibitions of Boolean functions

D. V. Ryabokon

Tomsk State University

Abstract: An algorithm for search of prohibitions of Boolean function based on the branch and bound method is proposed. It allows to find a prohibition of Boolean function, a prohibition of minimum length or all prohibitions under a specified length.

Keywords: prohibition of Boolean function, de Bruijn graph.

UDC: 519.7