Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 207,982,827 papers from all fields of science

Search

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

2001

2001

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

2000

2000

We introduce a new technique for solving some discrete optimization problems exactly. The motivation is that when searching the…

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…

Highly Cited

1984

Highly Cited

1984

1. Introduction.- 1.1 Design Styles for VLSI Systems.- 1.2 Automatic Logic Synthesis.- 1.3 PLA Implementation.- 1.4 History of…

1979

1979

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

1972

1972

An algorithm is described which generates the set of representative functions of the negation and/or permutation of variables and…

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…

Highly Cited

1961

Highly Cited

1961

This paper contains some applications of an elementary study of unate truth functions. One application is a method of deciding…