S. V. Avgustinovich, Yu. L. Vasil'ev, K. L. Rychkov, “The computation complexity in the class of formulas”, Diskretn. Anal. Issled. Oper., 2012, Volume 19, Issue 3,Pages <nobr>3

This article is cited in 4 papers

The computation complexity in the class of formulas

S. V. Avgustinovich^ab, Yu. L. Vasil'ev^a, K. L. Rychkov^a

^a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
^b Novosibirsk State University, Novosibirsk, Russia

Abstract: The exact value 18 of the computation complexity in the class of generalized $P$-schemes of ternary counter of multiplicity 3 dependent on 3 variables is obtained. Bibliogr. 6.

Keywords: computation complexity, generalized $P$-schemes, ternary linear function.

UDC: 519.714

Received: 11.07.2011
Revised: 30.11.2011