|
Diskretnyi Analiz i Issledovanie Operatsii, 2012, Volume 19, Issue 3, Pages 3–12
(Mi da686)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
The computation complexity in the class of formulas
S. V. Avgustinovichab, Yu. L. Vasil'eva, K. L. Rychkova 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.
Received: 11.07.2011 Revised: 30.11.2011
Citation:
S. V. Avgustinovich, Yu. L. Vasil'ev, K. L. Rychkov, “The computation complexity in the class of formulas”, Diskretn. Anal. Issled. Oper., 19:3 (2012), 3–12; J. Appl. Industr. Math., 6:4 (2012), 403–409
Linking options:
https://www.mathnet.ru/eng/da686 https://www.mathnet.ru/eng/da/v19/i3/p3
|
Statistics & downloads: |
Abstract page: | 365 | Full-text PDF : | 79 | References: | 55 | First page: | 7 |
|