Complexity of Functions from Some Classes of Three-Valued Logic / Dagaev D.A. // Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika. 2011. ? 3. P. 60-63 [Moscow Univ. Math. Bulletin. Vol. 66, N 3, 2011.].

The problem of the realization complexity for functions of the three-valued logic taking values from the set {0,1} by formulas over incomplete generating systems is considered. Upper and lower asymptotic estimates for the corresponding Shannon functions are obtained.

Key words: functions of three-valued logic, formulas, complexity of formulas.