DocumentCode
2202837
Title
Chow parameters in pseudothreshold logic
Author
Baugh, C.R.
fYear
1973
fDate
15-17 Oct. 1973
Firstpage
49
Lastpage
55
Abstract
The Investigation of Chow parameters is extended to pseudothreshold functions. Pseudothreshold logic is a generalization of threshold logic. Chow parameters are a set of n + 1 integers derived from a Boolean function of n variables. The main results are: 1. Two different pseudothreshold functions with the same Chow parameters have the same optimum structure. Thus, the optimum structures of pseudothreshold functions can be cataloged using Chow parameters. 2. The set of positive threshold functions is a subset of the set of positive, zero-free, pseudothreshold functions which is a subset of the nonnegative, nontrivial pseudothreshold functions which in turn is a subset of the measure minimum functions. 3. The set of positive threshold functions is a subset of the Intersection of the set of positive Chow unique functions and positive, zero-free, pseudothreshold functions. 4. The sets of positive Chow unique functions and the positive, zero-free, pseudothreshold functions are subsets of the Chow maximum functions which in turn is a subset of the positive Boolean functions.
Keywords
Boolean functions; Computer science; Laboratories; Logic; Telephony; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Switching and Automata Theory, 1973. SWAT '08. IEEE Conference Record of 14th Annual Symposium on
Conference_Location
USA
ISSN
0272-4847
Type
conf
DOI
10.1109/SWAT.1973.4
Filename
4569727
Link To Document