Moscow University Mathematics Bulletin

, Volume 72, Issue 3, pp 102–106 | Cite as

Mean computing time of Boolean operators by programs with restricted memory

Article
  • 23 Downloads

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

Copyright information

© Allerton Press, Inc. 2017

Authors and Affiliations

  1. 1.Moscow State UniversityFaculty of Mechanics and MathematicsLeninskie Gory, MoscowRussia

Personalised recommendations