Geodesic
On the complexity of a~cyclic shift of a~set of real numbers
Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 4, pp. 89-92

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

The complexity of implementing a cyclic shift of a $2^n$-tuple of real numbers by Boolean circuits over the basis consisting of a ternary choice function and all binary Boolean functions is shown to be $2^n n$. 
@article{DA_2006_13_4_a6,
     author = {A. V. Chashkin},
     title = {On the complexity of a~cyclic shift of a~set of real numbers},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {89--92},
     publisher = {mathdoc},
     volume = {13},
     number = {4},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2006_13_4_a6/}
}
TY  - JOUR
AU  - A. V. Chashkin
TI  - On the complexity of a~cyclic shift of a~set of real numbers
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2006
SP  - 89
EP  - 92
VL  - 13
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2006_13_4_a6/
LA  - ru
ID  - DA_2006_13_4_a6
ER  - 
%0 Journal Article
%A A. V. Chashkin
%T On the complexity of a~cyclic shift of a~set of real numbers
%J Diskretnyj analiz i issledovanie operacij
%D 2006
%P 89-92
%V 13
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2006_13_4_a6/
%G ru
%F DA_2006_13_4_a6
A. V. Chashkin. On the complexity of a~cyclic shift of a~set of real numbers. Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 4, pp. 89-92. http://geodesic.mathdoc.fr/item/DA_2006_13_4_a6/