Results 221 to 230 of about 24,202 (263)
Some of the next articles are maybe not open access.
Minimization of Boolean Functions
IEEE Transactions on Computers, 1971The 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
Hardware verification, Boolean logic programming, Boolean functional programming
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 2002One 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, 1978Abstract 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
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
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
Composition and functions of bacterial membrane vesicles
Nature Reviews Microbiology, 2023Masanori Toyofuku +2 more
exaly
The American Mathematical Monthly, 1963
(1963). Symmetric Boolean Functions. The American Mathematical Monthly: Vol. 70, No. 8, pp. 833-836.
openaire +1 more source
(1963). Symmetric Boolean Functions. The American Mathematical Monthly: Vol. 70, No. 8, pp. 833-836.
openaire +1 more source
Gene regulation by long non-coding RNAs and its biological functions
Nature Reviews Molecular Cell Biology, 2020Luisa Statello +2 more
exaly
The expanding regulatory mechanisms and cellular functions of circular RNAs
Nature Reviews Molecular Cell Biology, 2020Ling-Ling Chen
exaly
Global view of human protein glycosylation pathways and functions
Nature Reviews Molecular Cell Biology, 2020Katrine T Schjoldager +2 more
exaly