Mean computing time of Boolean operators by programs with restricted memory
- 23 Downloads
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.
Unable to display preview. Download preview PDF.