Geodesic
A lower bound for the complexity of generalized parallel-serial contact circuits for a~characteristic function of divisibility by~$q$
Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 6, pp. 68-76.

Voir la notice de l'article provenant de la source Math-Net.Ru

We consider generalization of the concept of a parallel-serial contact circuit in the case when the variables assigned to contacts can take not two as in the Boolean case but a greater number of values. The conductivity of contacts as well as in the Boolean case remains two-valued (a contact is either close or break). We obtain a lower bound for the complexity of such circuits computing the characteristic function of divisibility by $q$, i.e., the function $\varphi_q\colon\{0,1,\dots,q-1\}^n\to\{0,1\}$ which is equal to 1 if the sum of values of its variables is divided by $q$. Bibliogr. 6.
Keywords: Boolean function, complexity of circuits.
Mots-clés : contact circuit 
@article{DA_2010_17_6_a4,
     author = {K. L. Rychkov},
     title = {A lower bound for the complexity of generalized parallel-serial contact circuits for a~characteristic function of divisibility by~$q$},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {68--76},
     publisher = {mathdoc},
     volume = {17},
     number = {6},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2010_17_6_a4/}
}
TY  - JOUR
AU  - K. L. Rychkov
TI  - A lower bound for the complexity of generalized parallel-serial contact circuits for a~characteristic function of divisibility by~$q$
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2010
SP  - 68
EP  - 76
VL  - 17
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2010_17_6_a4/
LA  - ru
ID  - DA_2010_17_6_a4
ER  - 
%0 Journal Article
%A K. L. Rychkov
%T A lower bound for the complexity of generalized parallel-serial contact circuits for a~characteristic function of divisibility by~$q$
%J Diskretnyj analiz i issledovanie operacij
%D 2010
%P 68-76
%V 17
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2010_17_6_a4/
%G ru
%F DA_2010_17_6_a4
K. L. Rychkov. A lower bound for the complexity of generalized parallel-serial contact circuits for a~characteristic function of divisibility by~$q$. Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 6, pp. 68-76. http://geodesic.mathdoc.fr/item/DA_2010_17_6_a4/

[1] Rychkov K. L., “Modifikatsiya metoda V. M. Khrapchenko i primenenie eë k otsenkam slozhnosti $\pi$-skhem dlya kodovykh funktsii”, Diskret. analiz, 42, 1985, 91–98 | MR | Zbl

[2] Rychkov K. L., “O nizhnikh otsenkakh slozhnosti parallelno-posledovatelnykh kontaktnykh skhem, realizuyuschikh lineinye bulevy funktsii”, Sib. zhurn. issled. operatsii, 1:4 (1994), 33–52 | MR | Zbl

[3] Rychkov K. L., “O slozhnosti obobschënnykh kontaktnykh skhem”, Diskret. analiz i issled. operatsii, 16:5 (2009), 78–87 | MR

[4] Sachkov V. N., Vvedenie v kombinatornye metody diskretnoi matematiki, Nauka, M., 1982, 384 pp. | MR | Zbl

[5] Khrapchenko V. M., “O slozhnosti realizatsii lineinoi funktsii v klasse $\pi$-skhem”, Mat. zametki, 9:1 (1971), 35–40 | Zbl

[6] Khrapchenko V. M., “Ob odnom metode polucheniya nizhnikh otsenok slozhnosti $\pi$-skhem”, Mat. zametki, 10:1 (1971), 83–92 | MR | Zbl