Geodesic
Complexity of the realization of cyclic Boolean matrices by gate circuits
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 7 (1988), pp. 39-44.

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

@article{IVM_1988_7_a6,
     author = {M. I. Grinchuk},
     title = {Complexity of the realization of cyclic {Boolean} matrices by gate circuits},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {39--44},
     publisher = {mathdoc},
     number = {7},
     year = {1988},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1988_7_a6/}
}
TY  - JOUR
AU  - M. I. Grinchuk
TI  - Complexity of the realization of cyclic Boolean matrices by gate circuits
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1988
SP  - 39
EP  - 44
IS  - 7
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1988_7_a6/
LA  - ru
ID  - IVM_1988_7_a6
ER  - 
%0 Journal Article
%A M. I. Grinchuk
%T Complexity of the realization of cyclic Boolean matrices by gate circuits
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1988
%P 39-44
%N 7
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1988_7_a6/
%G ru
%F IVM_1988_7_a6
M. I. Grinchuk. Complexity of the realization of cyclic Boolean matrices by gate circuits. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 7 (1988), pp. 39-44. http://geodesic.mathdoc.fr/item/IVM_1988_7_a6/