Volume 19, No 3, 2012, P. 3-12
UDC 519.714
S. V. Avgustinovich, Yu. L. Vasil’ev, K. L. Rychkov
The computation complexity in the class of formulas
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.
Avgustinovich Sergey Vladimirovich 1,2
Vasil’ev Yurii Leonidovich 1
Rychkov Konstantin Leonidovich 1
1. S. L. Sobolev Institute of Mathematics, SB RAS,
4 Acad. Koptyug Ave., 630090 Novosibirsk, Russia
2.
Novosibirsk State University,
2 Pirogov St., 630090 Novosibirsk, Russia
e-mail: avgust@math.nsc.ru, vas@math.nsc.ru, rychkov@math.nsc.ru
