Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,316 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Exclusive or
Switching circuit theory
Broader (1)
Syntax (logic)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
BOOLEAN GRÖBNER BASIS REDUCTIONS ON DATAPATH CIRCUITS USING THE UNATE CUBE SET ALGEBRA
Utkarsh Gupta
,
P. Kalla
,
V. Rao
2017
Corpus ID: 51841169
Recent developments in formal datapath verification make efficient use of symbolic computer algebra algorithms for formal…
Expand
2016
2016
An Õ(n) Queries Adaptive Tester for Unateness
Subhash Khot
,
Igor Shinkar
Electron. Colloquium Comput. Complex.
2016
Corpus ID: 16992924
We present an adaptive tester for the unateness property of Boolean functions. Given a function f:{0,1}^n -> {0,1} the tester…
Expand
2010
2010
Application of CUDA in the Boolean Domain for the Unate Covering Problem
Eric Paul
,
B. Steinbach
,
M. Perkowski
2010
Corpus ID: 13388201
NVIDIA’s Compute Unified Device Architecture (CUDA) is a relatively-recent development that allows to realize very fast…
Expand
2001
2001
Strategies for solving the Boolean satisfiability problem using binary decision diagrams
P. Kalla
,
Zhihong Zeng
,
M. Ciesielski
Journal of systems architecture
2001
Corpus ID: 206131379
1998
1998
Conjunctions of Unate DNF Formulas: Learning and Structure
Aaron Feigelson
,
L. Hellerstein
Information and Computation
1998
Corpus ID: 16316049
Abstract A central topic in query learning is to determine which classes of Boolean formulas are efficiently learnable with…
Expand
1996
1996
Minimal delay test sets for unate gate networks
U. Sparmann
,
H. Mueller
,
S. Reddy
Asian Test Symposium
1996
Corpus ID: 10465508
We consider delay testing of a specific class of logic circuits, the so called 'unate gate networks (UGNs)', which are of…
Expand
1990
1990
Minimization of multioutput TANT networks for unlimited fan-in network model
M. Perkowski
,
M. Chrzanowska-Jeske
,
Tuhar Shah
Proceedings., IEEE International Conference on…
1990
Corpus ID: 1567775
A program for the minimization of multi-output three-level Boolean networks from NAND gates of unlimited fan-in is described…
Expand
1988
1988
Functional Test Generation Based on Unate Function Theory
V. Pitchumani
,
S. S. Soman
IEEE Trans. Computers
1988
Corpus ID: 206412721
The generation of a universal test set (UTS) for unate functions is used as a starting point. This test set is complete and…
Expand
1977
1977
Logic Properties of Unate Discrete and Switching Functions
A. Thayse
,
J. Deschamps
IEEE transactions on computers
1977
Corpus ID: 5180150
The total and local unateness of discrete and of switching functions are studied from a theoretical point of view. One shows that…
Expand
1971
1971
Recognition of Monotonic and Unate Cascade Realizable Functions Using an Informational Model of Switching Circuits
W. S. Matheson
IEEE transactions on computers
1971
Corpus ID: 13559168
A model of combinational switching circuits used as information processors is described. A set of entropies (in the information…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE