This article is cited in 1 scientific paper (total in 1 paper)
A generalization of Shannon function
N. P. Red'kin
Lomonosov Moscow State University
When investigating the complexity of implementing Boolean functions, it is usually assumed that the basis in which the schemes are constructed and the measure of the complexity of the schemes are known. For them, the Shannon function is introduced, which associates with each Boolean function the least complexity of implementing this function in the considered basis. In this paper we propose a generalization of such a Shannon function in the form of an upper bound that is taken over all functionally complete bases. This generalization gives an idea of the complexity of implementing Boolean functions in the “worst” bases for them. The conceptual content of the proposed generalization is demonstrated by the example of a conjunction.
Boolean function, Boolean circuit, complexity of a Boolean function, Shannon function.
PDF file (480 kB)
First page: PDF file
Discrete Mathematics and Applications, 2018, 28:5
N. P. Red'kin, “A generalization of Shannon function”, Diskr. Mat., 29:2 (2017), 70–83
Citation in format AMSBIB
\paper A generalization of Shannon function
\jour Diskr. Mat.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
N. P. Redkin, “Obobschennaya slozhnost lineinykh bulevykh funktsii”, Diskret. matem., 30:4 (2018), 88–95
|Number of views:|