Results 271 to 280 of about 51,980 (308)

On Complementation of Boolean Functions

IEEE Transactions on Computers, 1972
A theorem is presented that simplifies the computations necessary for complementing a Boolean function.
Se June Hong, Daniel L. Ostapko
openaire   +2 more sources

Graph Functions of Boolean Functions

IEEE Transactions on Computers, 1984
We introduce and characterize those Boolean functions (graph functions) which can be regarded as characteristic functions of graphs of other Boolean functions. An algorithm for detecting these functions is also presented. Finally, we discuss the complexity of computing a Boolean function which can be regarded as a graph function.
Corina Reischer, Dan A. Simovici
openaire   +2 more sources

Almost Boolean functions: the design of Boolean functions by spectral inversion

The 2003 Congress on Evolutionary Computation, 2003. CEC '03., 2004
The design of Boolean functions with properties of cryptographic significance is a hard task. In this paper, we adopt an unorthodox approach to the design of such functions. Our search space is the set of functions that possess the required properties. It is “Boolean‐ness” that is evolved.
John A. Clark, Jeremy L. Jacob, Subhamoy Maitra, Pantelimon Stanica   +3 more
openaire   +2 more sources

Minimization of Boolean Functions

IEEE Transactions on Computers, 1971
The Quine–McCluskey method of minimizing a Boolean function gives all the prime implicants, from which the essential terms are selected by one or more cover tables known as the prime implicant tables. This note describes a tabular method where the essential prime implicants are selected during the process of forming the combination tables, and other ...
openaire   +1 more source

On Semibent Boolean Functions

IEEE Transactions on Information Theory, 2012
We show that any Boolean function, in even dimension, equal to the sum of a Boolean function g which is constant on each element of a spread and of a Boolean function h whose restrictions to these elements are all linear, is semibent if and only if g and h are both bent.
Claude Carlet, Sihem Mesnager
openaire   +1 more source

On learning Boolean functions

Proceedings of the nineteenth annual ACM conference on Theory of computing - STOC '87, 1987
Robotics ...
openaire   +1 more source

Invertible Boolean Functions

IEEE Transactions on Electronic Computers, 1964
This paper describes a group theoretic approach to count the number of equivalence classes of invertible Boolean functions under the group operation of complementation, permutation, combinations of complementation and permutation, and linear and affine transformations.
openaire   +2 more sources

SUPER-BOOLEAN FUNCTIONS AND FREE BOOLEAN QUASILATTICES

Discrete Mathematics, Algorithms and Applications, 2014
A Boolean quasilattice is an algebra with hyperidentities of the variety of Boolean algebras. In this paper, we give a functional representation of the free n-generated Boolean quasilattice with two binary, one unary and two nullary operations. Namely, we define the concept of super-Boolean function and prove that the free Boolean quasilattice with two
Yu. M. Movsisyan, V. A. Aslanyan
openaire   +2 more sources

Boolean Functions as Models for Quantified Boolean Formulas

Journal of Automated Reasoning, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans Kleine Büning, K. Subramani 0001, Xishun Zhao   +2 more
openaire   +1 more source

Approximation of a partial boolean function by a monotonic boolean function

USSR Computational Mathematics and Mathematical Physics, 1978
Abstract THE PROBLEM of finding a monotonic Boolean function best approximation a specified partial (not defined everywhere) Boolean function, is solved by a flow algorithm. Among the monotonic functions giving the best approximation, the function possessing the simplest disjunctive normal form is chosen.
openaire   +2 more sources