|Title:||Bounds On Decision Trees For Monotonic Boolean Functions
|Authors:||Y. Breitbart, D. Gelperin, M. Newborn
|Abstract:||The expected number of decisions for the 'worst' and the maximum number of decisions for the 'best' monotonic Boolean function of n variables are given. The utility of these characteristics for switching theory and process control is discussed. Keywords and phrases: monotonic Boolean function, symmetric function, decision tree, switching theory.|
|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/CS0037), 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