Results 221 to 230 of about 40,553 (242)
Some of the next articles are maybe not open access.

Hardware verification, Boolean logic programming, Boolean functional programming

Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 2002
One of the main obstacles to automatic verification of finite state systems (FSSs) is state explosion. In this respect automatic verification of an FSS M using model checking and binary decision diagrams (BDDs) has an intrinsic limitation: no automatic global optimization of the verification task is possible until a BDD representation for M is ...
openaire   +2 more sources

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

Minimizing Boolean Functions

2012
This chapter describes the graphical and algebraic most widely used ways to minimize logic functions (in order to reduce the circuit’s complexity), like truth tables, Karnaugh Maps that are based on the rule of complementation and the Quine-Mccluskey method, which is functionally identical to Karnaugh mapping, but its tabular form makes it more ...
Bohdan Borowik   +3 more
openaire   +1 more source

Symmetric Boolean Functions

The American Mathematical Monthly, 1963
(1963). Symmetric Boolean Functions. The American Mathematical Monthly: Vol. 70, No. 8, pp. 833-836.
openaire   +1 more source

Bent Boolean functions

2009
Thomas W. Cusick, Pantelimon Stanica
openaire   +1 more source

Boolean Functions

1997
R. K. Rao Yarlagadda, John E. Hershey
openaire   +1 more source

Boolean Functions

1998
Christoph Meinel, Thorsten Theobald
openaire   +1 more source

Home - About - Disclaimer - Privacy