Results 281 to 290 of about 36,413 (311)

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

On the classification of Boolean functions

IRE Transactions on Information Theory, 1959
Two Boolean functions which differ only by permutation and complementation of their n input variables belong to the same symmetry class. Methods are described for determining the number of symmetry classes for functions of n variables, and for ascertaining whether or not two functions belong to the same class.
openaire   +1 more source

The graph of a boolean function

Journal of Experimental & Theoretical Artificial Intelligence, 1989
Abstract In this semi-expository note, we first recall that every boolean function f of n variables is determined uniquely by a certain subset S of the nodes of the hypercube Q". We then propose the subgraph of Qn induced by S as a realization of f, and call it the graph of a boolean function.
openaire   +1 more source

Learning boolean functions

Systems and Computers in Japan, 1991
AbstractAlthough various formal models of learning have been studied in the past, a realistic model taking into consideration the time required for learning has not been proposed. Recently, Valiant [8] proposed a general learning model based on the theory of computational complexity, gave a definition of learnability, and obtained various classes of ...
Qian-Ping Gu, Akira Maruoka
openaire   +1 more source

Monotone Boolean functions

Russian Mathematical Surveys, 2003
Summary: Monotone Boolean functions are an important object in discrete mathematics and mathematical cybernetics. Topics related to these functions have been actively studied for several decades. Many results have been obtained, and many papers published.
openaire   +2 more sources

On the independence of Boolean functions

International Journal of Computer Mathematics, 2005
Boolean functions are widely used because they can be used to precisely describe logical circuits. Properties of Boolean functions with respect to their applications to cryptography have been studied, but relationship between Boolean functions are rarely studied.
openaire   +1 more source

The complexity of monotone boolean functions

Mathematical Systems Theory, 1977
We study the realization of monotone Boolean functions by networks. Our main result is a precise version of the following statement: the complexity of realizing a monotone Boolean function ofn arguments is less by the factor (2/πn)1/2, whereπ is the circular ratio, than the complexity of realizing an arbitrary Boolean function ofn arguments.
openaire   +1 more source

On the Design of Universal Boolean Functions

IEEE Transactions on Computers, 1971
A Boolean function U( z 1 ,...,z m ) is universal for given n≥1 and a set I of variables if it realizes all Boolean functions f(x 1 ,..., x n ) by substituting for each zj a variable of I. Designs of universal Boolean functions for various specifications of I are considered for the practical cases of ...
openaire   +2 more sources

On the Representation of Boolean and Real Functions as Hamiltonians for Quantum Computing

ACM Transactions on Quantum Computing, 2021
Stuart Hadfield
exaly