Algorithms for fast evaluation of Boolean expressions

DOI10.1007/BF00288743MaRDI QIDQ1393275zbMATH OpenFDO

Authors Allen Reiter, Yuri Breitbart

Publication date 1974

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF00288743

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cites work

• A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
• An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions
• Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
• scientific article; zbMATH DE number 3473266 (Why is no real title available?)
• Information theory applied to the conversion of decision tables to computer programs

Cited in

(3)

• Time-optimal short-circuit evaluation of Boolean expressions
• Fast sequential evaluation of monotonic Boolean functions
• Optimal sequential arrangement of evaluation trees for Boolean functions

This page was built for publication: Algorithms for fast evaluation of Boolean expressions

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