Algorithms for fast evaluation of Boolean expressions

DOI10.1007/BF00288743zbMath0276.68022MaRDI QIDQ1393275

Allen Reiter, Yuri Breitbart

Publication date: 1974

Published in: Acta Informatica (Search for Journal in Brave)

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Related Items

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

Cites Work

• Unnamed Item
• A branch-and-bound algorithm to obtain an optimal evaluation tree for monotonic Boolean functions
• Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
• Information theory applied to the conversion of decision tables to computer programs
• An Efficient Algorithm for Finding Certain Minimum-Cost Procedures for Making Binary Decisions