Mean computing time of Boolean operators by programs with restricted memory

DOI10.3103/S0027132217030032MaRDI QIDQ2403571zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 8 September 2017

Published in Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3103/s0027132217030032

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Average time of computing Boolean operators
• On the mean evaluation of polynomially reducible Boolean functions
• scientific article; zbMATH DE number 1037955
• Average complexity of symmetric Boolean functions
• On the realization of linear Boolean operators by straight-line programs with a conditional stop

Cites work

• Average time of computing Boolean operators
• scientific article; zbMATH DE number 1037955 (Why is no real title available?)

Cited in

(3)

• Time-optimal short-circuit evaluation of Boolean expressions
• Average time of computing Boolean operators
• On the realization of linear Boolean operators by straight-line programs with a conditional stop

This page was built for publication: Mean computing time of Boolean operators by programs with restricted memory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2403571)