Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 219,784,707 papers from all fields of science

Search

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

We give an adaptive algorithm that tests whether an unknown Boolean function f: {0,1}^n -≈ {0, 1} is unate (i.e. every…

2007

2007

AbstractBollobás, Brightwell and Leader [2] showed that there are at most
$$2^{\left( \begin{subarray}{l} n \\ 2 \end{subarray…

2001

2001

We propose a new way of decomposing completely or incompletely specified Boolean functions into a set of unate functional blocks…

2000

2000

The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and…

1996

1996

We consider delay testing of a specific class of logic circuits, the so called 'unate gate networks (UGNs)', which are of…

1994

1994

Many combinatorial problems in LSI design can be described with cube set expressions. We discuss unate cube set algebra based on…

1988

1988

The generation of a universal test set (UTS) for unate functions is used as a starting point. This test set is complete and…

1979

1979

In this correspondence, the number of functions and the number of equivalence classes of functions realized by fanout-free…

1975

1975

This correspondence suggests an improved characterization of Boolean functions based on parameters, for unate cascade (UC…

Highly Cited

1971

Highly Cited

1971

A derivation of test sets S<inf>0</inf>and S<inf>1</inf>for irredundant unate logical circuits is presented. It is shown that…