The computation complexity in the class of formulas
Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 3, pp. 3-12
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
@article{DA_2012_19_3_a0,
author = {S. V. Avgustinovich and Yu. L. Vasil'ev and K. L. Rychkov},
title = {The computation complexity in the class of formulas},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {3--12},
publisher = {mathdoc},
volume = {19},
number = {3},
year = {2012},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2012_19_3_a0/}
}
TY - JOUR AU - S. V. Avgustinovich AU - Yu. L. Vasil'ev AU - K. L. Rychkov TI - The computation complexity in the class of formulas JO - Diskretnyj analiz i issledovanie operacij PY - 2012 SP - 3 EP - 12 VL - 19 IS - 3 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/DA_2012_19_3_a0/ LA - ru ID - DA_2012_19_3_a0 ER -
S. V. Avgustinovich; Yu. L. Vasil'ev; K. L. Rychkov. The computation complexity in the class of formulas. Diskretnyj analiz i issledovanie operacij, Tome 19 (2012) no. 3, pp. 3-12. http://geodesic.mathdoc.fr/item/DA_2012_19_3_a0/