|
The Complexity of Pseudo-Linear Functions / Dagaev D.A. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2010. № 2. P. 53-56 [Moscow Univ. Math. Bulletin. Vol. 65, No 2, 2010. P. 88-91]. 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.
|