|Title:||A branch-ann-bound algorithm for optimal evaluation of monotonic boolean functions
|Authors:||Yu. Breitbart and A. Reiter
|Abstract:||For monotonic Boolean functions, a branch-and-bound algorithm is given for constructing an optimal decision tree (sequential evaluation procedure). The tree is optimal in minimizing the average number of variables which need to be examined.|
|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/CS0035), 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