Answers are grounded in this paper and cite their sources.
This paper describes an algorithm for scanning Boolean expressions. Such an algorithm takes a complex, relational expression and transforms it into an optimal set of computing steps. The result is optimal in the sense that no redundant evaluations are made. The particular algorithm described is advantageous in that, as a variant of a well-known *
No takes yet. Share an insight, caveat, or question.
Arden et al. (1962) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: