|
Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Volume 13, Issue 4, Pages 89–92
(Mi da13)
|
|
|
|
On the complexity of a cyclic shift of a set of real numbers
A. V. Chashkin M. V. Lomonosov Moscow State University
Abstract:
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$.
Citation:
A. V. Chashkin, “On the complexity of a cyclic shift of a set of real numbers”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006), 89–92; J. Appl. Industr. Math., 1:2 (2007), 175–177
Linking options:
https://www.mathnet.ru/eng/da13 https://www.mathnet.ru/eng/da/v13/s1/i4/p89
|
Statistics & downloads: |
Abstract page: | 344 | Full-text PDF : | 119 | References: | 39 |
|