|Title:||On optimal algorithms for evaluating monotonic boolean functions
|Authors:||Y. Breitbart, A. Reiter
|Abstract:||Boolean functions occur with great frequency in computing. There is hardly a program written without an "if clause" whose arguments must be evaluated. We shall refer to simple predicates of the form "A <relational operator> B" as Boolean variables. The usual practice in writing compilers is to generate code which skips over the evaluation of variables no longer relevant to the value of the expression as a whole (see e.g. , section 13.6) but not to attempt any optimization by trying to decide in what order to examine the variables.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1974/CS/CS0031), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1974
To the main CS technical reports page
Computer science department, Technion