|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2014, Number 3, Pages 14–19
(Mi vmumm317)
|
|
|
|
Mathematics
Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth $3$
S. A. Lozhkin, V. A. Konovodov Lomonosov Moscow State University, Faculty of Computational Mathematics and Cybernetics
Abstract:
The realization complexity of Boolean functions associated with finite grammars in the class of formulae of alternation depth 3 is studied. High accuracy asymptotic bounds are obtained for the corresponding Shannon function.
Key words:
Boolean formulae, complexity, alternation depth, Shannon function, high accuracy asymptotic bounds.
Received: 13.02.2013
Citation:
S. A. Lozhkin, V. A. Konovodov, “Complexity of realization of Boolean functions from some classes related to finite grammars by formulas of alternation depth $3$”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2014, no. 3, 14–19; Moscow University Mathematics Bulletin, 69:3 (2014), 100–105
Linking options:
https://www.mathnet.ru/eng/vmumm317 https://www.mathnet.ru/eng/vmumm/y2014/i3/p14
|
|