Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Unate function

Known as: Binate Function (Computing), Binate function 
A unate function is a type of boolean function which has monotonic properties.They have been studied extensively in switching theory. A function is… Expand
Wikipedia

Papers overview

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
  • figure 2
  • table 1
2000
2000
We introduce a new technique for solving some discrete optimization problems exactly. The motivation is that when searching the… Expand
  • table I
  • table II
  • table III
2000
2000
The paper presents a new approach to solve the unate covering problem based on exploitation of information provided by Lagrangean… Expand
  • figure 1
  • figure 2
  • table 3
  • table 2
  • table 1
1997
1997
Abstract We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden… Expand
  • figure 3
1994
1994
  • S. Minato
  • 31st Design Automation Conference
  • 1994
  • Corpus ID: 3346198
Many combinatorial problems in LSI design can be described with cube set expressions. We discuss unate cube set algebra based on… Expand
  • figure 1
  • figure 2
  • table 3
  • figure 6
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
1979
1979
In this correspondence, the number of functions and the number of equivalence classes of functions realized by fanout-free… Expand
  • figure 1
  • table I
  • figure 3
  • figure 4
  • figure 7
1975
1975
This correspondence suggests an improved characterization of Boolean functions based on parameters, for unate cascade (UC… Expand
Highly Cited
1971
Highly Cited
1971
  • R. Betancourt
  • IEEE Transactions on Computers
  • 1971
  • Corpus ID: 14475460
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
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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