Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Recent developments in formal datapath verification make efficient use of symbolic computer algebra algorithms for formal… 
2016
2016
We present an adaptive tester for the unateness property of Boolean functions. Given a function f:{0,1}^n -> {0,1} the tester… 
2010
2010
NVIDIA’s Compute Unified Device Architecture (CUDA) is a relatively-recent development that allows to realize very fast… 
1998
1998
Abstract A central topic in query learning is to determine which classes of Boolean formulas are efficiently learnable with… 
1996
1996
We consider delay testing of a specific class of logic circuits, the so called 'unate gate networks (UGNs)', which are of… 
1990
1990
A program for the minimization of multi-output three-level Boolean networks from NAND gates of unlimited fan-in is described… 
1988
1988
The generation of a universal test set (UTS) for unate functions is used as a starting point. This test set is complete and… 
1977
1977
The total and local unateness of discrete and of switching functions are studied from a theoretical point of view. One shows that… 
1971
1971
A model of combinational switching circuits used as information processors is described. A set of entropies (in the information…