Topic
Boolean function
About: Boolean function is a research topic. Over the lifetime, 10089 publications have been published within this topic receiving 201604 citations. The topic is also known as: Boolean operation.
Papers published on a yearly basis
1 / 2
Papers
TL;DR: A minimizing version of the Abraham sum-of-disjoint products algorithm, called the Abraham-Locks-Revised (ALR) method, as an improved technique for obtaining a disjoint system-reliability formula, and obtains a shorter formula than any other known sdp method.
Abstract: This paper describes a minimizing version of the Abraham sum-of-disjoint products (sdp) algorithm, called the Abraham-Locks-Revised (ALR) method, as an improved technique for obtaining a disjoint system-reliability formula. The principal changes are: 1) Boolean minimization and rapid inversion are substituted for time-consuming search operations of the inner loop. 2) Paths and terms are ordered both according to size and alphanumerically. ALR reduces the computing cost and data processing effort required to generate the disjoint system formula compared to the seminal 1979 Abraham paper, and obtains a shorter formula than any other known sdp method. Very substantial savings are achieved in processing large paths of complex networks.
115 citations
Book•
1 Jan 2001
TL;DR: In this article, the authors propose a functional decomposition for completely specified single-output functions and a functional decomposition for incompletely specified multi-output function for large circuits.
Abstract: Preface. Acknowledgements. Introduction. 1. Realizations of Boolean Functions. 2. Minimization of BDDS. 3. Functional Decomposition for Completely Specified Single-Output Functions. 4. Functional Decomposition for Completely Specified Multi-Output Functions. 5. Functional Decomposition for Incompletely Specified Functions. 6. Non-Disjoint Decompositions. 7. Large Circuits. Appendices. Index.
114 citations
TL;DR: A sharp delineation between classes of SDSs whose behavior is easy to predict and thosewhose behavior is hard to predict is shown, and new PSPACE-hard lower bounds on the complexity of state reachability problems for these models are shown.
114 citations
1 Nov 1988
TL;DR: The paper is devoted to designing nonlinear Boolean functions and addresses the problem of the generation of Boolean permutations to obtain the collection of non linear Boolean functions.
Abstract: The paper is devoted to designing nonlinear Boolean functions. The first part reviews the case of Boolean functions of n variables. The second part addresses the problem of the generation of Boolean permutations to obtain the collection of nonlinear Boolean functions.
113 citations
5 Nov 1989
TL;DR: The authors give a procedure, similar to the Quine-McCluskey procedure, for finding the global optimum sum-of-product representation for a Boolean relation and give an algorithm for it and review the relation of binate covering to tautology checking.
Abstract: Boolean relations are a generalization of incompletely specified logic functions. The authors give a procedure, similar to the Quine-McCluskey procedure, for finding the global optimum sum-of-product representation for a Boolean relation. This is formulated as a binate covering problem, i.e. as a generalization of the ordinary (unate) covering problem. They give an algorithm for it and review the relation of binate covering to tautology checking. The procedure has been implemented and results are presented. >
113 citations
Related Topics (5)
Performance Metrics
| Year | Papers |
|---|---|
| 2026 | 3 |
| 2025 | 85 |
| 2024 | 130 |
| 2023 | 258 |
| 2022 | 454 |
| 2021 | 278 |