Skip to main content
SpringerLink
Log in

Mean computing time of Boolean operators by programs with restricted memory

  • Published:
Moscow University Mathematics Bulletin Aims and scope

Abstract

The mean computing time for computation of values of Boolean operators by straight-line programs with a conditional stop and the storage of at most D is studied. An asymptotically exact formula for the mean computation time is obtained for growing number n of variables and for almost all Boolean operators with m components in a wide range of D and m.

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. A. V. Chashkin, “Mean Calculation Time for Values of Boolean Functions,” Disrketn. Analiz Issled. Oper. Ser. 1. 4 (1), 60 (1997).

    MathSciNet  MATH  Google Scholar 

  2. A. V. Chashkin, “Mean Calculation Time for Values of Boolean Operators,” Disrketn. Analiz Issled. Oper. Ser. 1. 5 (1), 88 (1998).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Moscow State University, Faculty of Mechanics and Mathematics, Leninskie Gory, Moscow, 119991, Russia

    A. V. Chashkin

Authors
  1. A. V. Chashkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. V. Chashkin.

Additional information

Original Russian Text © A.V. Chashkin, 2017, published in Vestnik Moskovskogo Universiteta, Matematika. Mekhanika, 2017, Vol. 72, No. 3, pp. 16–21.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chashkin, A.V. Mean computing time of Boolean operators by programs with restricted memory. Moscow Univ. Math. Bull. 72, 102–106 (2017). https://doi.org/10.3103/S0027132217030032

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132217030032

Search

Navigation