Semantic Scholar uses AI to extract papers important to this topic.
We propose a new way of decomposing completely or incompletely specified Boolean functions into a set of unate functional blocks… Expand We introduce a new technique for solving some discrete optimization problems exactly. The motivation is that when searching the… Expand The paper presents a new approach to solve the unate covering problem based on exploitation of information provided by Lagrangean… Expand Abstract We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden… Expand Many combinatorial problems in LSI design can be described with cube set expressions. We discuss unate cube set algebra based on… Expand 1. Introduction.- 1.1 Design Styles for VLSI Systems.- 1.2 Automatic Logic Synthesis.- 1.3 PLA Implementation.- 1.4 History of… Expand In this correspondence, the number of functions and the number of equivalence classes of functions realized by fanout-free… Expand This correspondence suggests an improved characterization of Boolean functions based on parameters, for unate cascade (UC… Expand 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… Expand This paper contains some applications of an elementary study of unate truth functions. One application is a method of deciding… Expand