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.
Fulltext:
PDF file (228 kB)