Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

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… Expand

Is this relevant?

2000

2000

The paper presents a new approach to solve the unate covering problem based on exploitation of information provided by Lagrangean… Expand

Is this relevant?

2000

2000

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

Is this relevant?

1997

1997

Abstract We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden… Expand

Is this relevant?

1996

1996

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

Is this relevant?

1994

1994

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

Is this relevant?

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… Expand

Is this relevant?

1979

1979

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

Is this relevant?

1975

1975

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

Is this relevant?

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… Expand

Is this relevant?