|
|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2010, Number 2, Pages 53–56
(Mi vmumm771)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Short notes
The complexity of pseudo-linear functions
D. A. Dagaev Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
Upper and lower estimates for the complexity of functions of the $3$-valued logic taking values from the set $\{0,1\}$ with linear Boolean restrictions are derived.
Key words:
functions of three-valued logic, formulas, complexity of formulas.
Received: 18.09.2009
Citation:
D. A. Dagaev, “The complexity of pseudo-linear functions”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2010, no. 2, 53–56
Linking options:
https://www.mathnet.ru/eng/vmumm771 https://www.mathnet.ru/eng/vmumm/y2010/i2/p53
|
|