Geodesic
On distributed circuits
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 6, pp. 71-81.

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

The class of distributed circuits is introduced. These circuits simulate the computation by distributed memory machines. Some bounds on the complexity of computation for Boolean functions and systems of Boolean functions are proved. Bibliogr. 10.
Keywords: computation complexity, combinatorial circuit, computation simulation. 
@article{DA_2011_18_6_a4,
     author = {E. A. Okolnishnikova},
     title = {On distributed circuits},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {71--81},
     publisher = {mathdoc},
     volume = {18},
     number = {6},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_6_a4/}
}
TY  - JOUR
AU  - E. A. Okolnishnikova
TI  - On distributed circuits
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 71
EP  - 81
VL  - 18
IS  - 6
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_6_a4/
LA  - ru
ID  - DA_2011_18_6_a4
ER  - 
%0 Journal Article
%A E. A. Okolnishnikova
%T On distributed circuits
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 71-81
%V 18
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_6_a4/
%G ru
%F DA_2011_18_6_a4
E. A. Okolnishnikova. On distributed circuits. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 6, pp. 71-81. http://geodesic.mathdoc.fr/item/DA_2011_18_6_a4/

[1] Andreev A. E., “Ob odnom metode polucheniya nizhnikh otsenok slozhnosti individualnykh monotonnykh funktsii”, Dokl. AN SSSR, 282:5 (1985), 1033–1037 | MR | Zbl

[2] Lupanov O. B., “O sinteze nekotorykh klassov upravlyayuschikh sistem”, Problemy kibernetiki, 10, Nauka, M., 1963, 63–97 | MR

[3] Lupanov O. B., “Ob odnom podkhode k sintezu upravlyayuschikh sistem – printsipe lokalnogo kodirovaniya”, Problemy kibernetiki, 14, Nauka, M., 1965, 31–110 | MR

[4] Okolnishnikova E. A., “Nizhnie otsenki slozhnosti realizatsii kharakteristicheskikh funktsii dvoichnykh kodov binarnymi programmami”, Metody diskretnogo analiza v sinteze realizatsii bulevykh funktsii, Sb. nauch. tr., 51, In-t matematiki SO AN SSSR, Novosibirsk, 1991, 61–83 | MR

[5] Okolnishnikova E. A., “Ob odnom metode polucheniya nizhnikh otsenok slozhnosti realizatsii bulevykh funktsii nedeterminirovannymi vetvyaschimisya programmami”, Diskret. analiz i issled. operatsii. Ser. 1, 8:4 (2001), 76–112 | MR

[6] Okolnishnikova E. A., “Nizhnyaya otsenka slozhnosti vychisleniya kharakteristicheskikh funktsii BChKh-kodov vetvyaschimisya programmami”, Diskret. analiz i issled. operatsii, 16:5 (2009), 69–77 | MR

[7] “Parallelnye mashiny”, Entsiklopediya “Diskretnaya matematika”, Bolshaya Rossiiskaya entsiklopediya, M., 2004, 193–194

[8] “Parallelnykh vychislenii teoriya”, Entsiklopediya “Diskretnaya matematika”, Bolshaya Rossiiskaya entsiklopediya, M., 2004, 194–196

[9] Razborov A. A., “Nizhnie otsenki slozhnosti monotonnoi slozhnosti nekotorykh bulevykh funktsii”, Dokl. AN SSSR, 281:4 (1985), 798–801 | MR | Zbl

[10] Chashkin A. V., “O slozhnosti bulevykh matrits, grafov i sootvetstvuyuschikh im bulevykh funktsii”, Diskret. matematika, 6:2 (1994), 43–73 | MR | Zbl