Time-optimal short-circuit evaluation of Boolean expressions

DOI10.1016/0020-0190(88)90132-9MaRDI QIDQ1115174zbMATH OpenOpenAlexFDO

Authors Masataka Sassa, Ikuo Nakata

Publication date 1988

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(88)90132-9

zbMATH Keywords

Boolean expressioncode generationexpected execution timeoptimizationshort-circuit evaluationshort-circuiting

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Mean computing time of Boolean operators by programs with restricted memory
• scientific article; zbMATH DE number 1037955
• scientific article; zbMATH DE number 2084329
• Average time of computing Boolean operators
• On the complexity of the evaluation of transient extensions of Boolean functions
• On the complexity of the evaluation of transient extensions of Boolean functions
• Complexity of sequential implementation of partial Boolean functions
• scientific article; zbMATH DE number 3957104
• scientific article; zbMATH DE number 1903342

Cites work

• Algorithms for fast evaluation of Boolean expressions
• Compiling short-circuit boolean expressions in one pass
• On evaluating boolean expressions

Cited in

(1)

• Multiprocessor simulation strategies with optimal speed-up

This page was built for publication: Time-optimal short-circuit evaluation of Boolean expressions

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