706 search results - page 39 / 142 » On a quasi-ordering on Boolean functions |
STACS
1998
Springer
13 years 12 months ago
1998
Springer
We consider Boolean functions represented by decision lists, and study their relationships to other classes of Boolean functions. It turns out that the elementary class of 1-decis...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
For an n-variate degree
ICCAD
1999
IEEE
14 years 17 hour ago
1999
IEEE
Algorithmic logic synthesis is usually carried out in two stages, the independent stage where logic minimization is performed on the Boolean equations with no regard to physical p...
DSD
2003
IEEE
14 years 1 months ago
2003
IEEE
We present a novel heuristic algorithm for two-level Boolean minimization. In contrast to the other approaches, the proposed method firstly finds the coverage of the on-sets and f...
VLSID
2002
IEEE
14 years 19 days ago
2002
IEEE
A new approach to synthesizing totally symmetric Boolean functions is presented. First, a novel cellular array is introduced for synthesizing unate symmetric functions. Using this...