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…

Papers overview

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

2017

We give an adaptive algorithm that tests whether an unknown Boolean function f: {0,1}^n -≈ {0, 1} is unate (i.e. every…

2017

Recent developments in formal datapath verification make efficient use of symbolic computer algebra algorithms for formal…

2014

Sensitivity, block sensitivity, and certificate complexity are complexity measures for Boolean functions. In this paper, we prove…

2001

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

1996

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

1988

The generation of a universal test set (UTS) for unate functions is used as a starting point. This test set is complete and…

1979

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

1977

The total and local unateness of discrete and of switching functions are studied from a theoretical point of view. One shows that…

1975

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

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…