Skip to main content
SpringerLink
Log in

On the complexity of a cyclic shift of a set of real numbers

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

Abstract

The complexity of implementing a cyclic shift of a 2n-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 2n n.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Yu. Grigor’ev, “A Nonlinear Lower Bound on Circuits for Systems of Disjunctions in Monotone Boolean Basis,” Zap. Nauchn. Sern. LOMI 68, 19–25 (1977).

    MathSciNet  Google Scholar 

  2. O. V. Lupanov, “On One Approach to the Synthesis of Control Systems: the Principle of Local Coding,” Problems in Cybernetics, Vol. 14 (Nauka, Moscow, 1965), pp. 31–110 [in Russian].

    Google Scholar 

  3. R. G. Nigmatullin, Complexity of Boolean Functions (Nauka, Moscow, 1991) [in Russian].

    MATH  Google Scholar 

  4. J. Savage, Models of Computation: Exploring the Power of Computing (Addison Wesley, Reading, MA, 1998).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mechanics and Mathematics, Moscow State University, Vorob’ovy Gory, Moscow, 119922, Russia

    A. V. Chashkin

Authors
  1. A. V. Chashkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Original Russian Text © A.V. Chashkin, 2006, published in Diskretnyi Analiz i Issledovanie Operatsii, Ser. 1, 2006, Vol. 13, No. 4, pp. 89–92.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chashkin, A.V. On the complexity of a cyclic shift of a set of real numbers. J. Appl. Ind. Math. 1, 175–177 (2007). https://doi.org/10.1134/S199047890702007X

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S199047890702007X

Keywords

Search

Navigation