706 search results - page 75 / 142 » On a quasi-ordering on Boolean functions |
TKDE
2002
13 years 8 months ago
2002
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
DATE
1998
IEEE
14 years 1 months ago
1998
IEEE
We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main id...
ICFP
2009
ACM
14 years 9 months ago
2009
ACM
Functional programming languages ought to play a central role in mathematics education for middle schools (age range: 10?14). After all, functional programming is a form of algebr...
DAC
2001
ACM
14 years 10 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
DAC
2003
ACM
14 years 10 months ago
2003
ACM
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...