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… (More)
Wikipedia

Related topics

Related topics

3 relations
Exclusive orSwitching circuit theory

Broader (1)

Syntax (logic)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
An ~O(n) Queries Adaptive Tester for Unateness
We present an adaptive tester for the unateness property of Boolean functions. Given a function f : {0, 1} → {0, 1} the tester… (More)
Is this relevant?
2015
2015
Evaluation and Optimization of GPU Based Unate Covering Algorithms
The calculation of an exact minimal cover of a Boolean function is an NP -complete problem which has important applications in… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
Is this relevant?
2011
2011
Size-energy tradeoffs for unate circuits computing symmetric Boolean functions
A unate gate is a logical gate computing a unate Boolean function, which is monotone in each variable. Examples of unate gates… (More)
  • figure 1
  • figure 2
Is this relevant?
2010
2010
Identification of genetic network dynamics with unate structure
MOTIVATION Modern experimental techniques for time course measurement of gene expression enable the identification of dynamical… (More)
  • figure 1
  • figure 2
Is this relevant?
2001
2001
Unate Decomposition of Boolean Functions
We propose a new way of decomposing completely or incompletely specified Boolean functions into a set of unate functional blocks… (More)
  • figure 2
  • table 1
Is this relevant?
1997
1997
The Forbidden Projections of Unate Functions
We characterize the forbidden projections of unate Boolean functions. Forbidden projections are analogous to forbidden graph… (More)
  • figure 3
Is this relevant?
1996
1996
Minimal Delay Test Sets for Unate Gate Networks
We consider delay testing of a speciic class of logic circuits, the so calledùnate gate networks (UGNs)', which are of importance… (More)
  • figure 1
Is this relevant?
1994
1994
Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs
Many combinatorial problems in LSI design can be described with cube set expressions. We discuss unate cube set algebra based on… (More)
  • figure 1
  • figure 2
  • table 3
  • figure 6
Is this relevant?
1975
1975
Characterization of Unate Cascade Realizability Using Parameters
This correspondence suggests an improved characterization of Boolean functions based on parameters, for unate cascade (UC… (More)
Is this relevant?
1971
1971
Derivation of Minimum Test Sets for Unate Logical Circuits
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?