• DocumentCode
    1136255
  • Title

    Analysis of Algorithms for the Evaluation of Monotonic Boolean Functions

  • Author

    Breitbart, Yuri ; Gal, Shmuel

  • Author_Institution
    Department of Computer Science and Electrical Engineering, University of Wisconsin
  • Issue
    11
  • fYear
    1978
  • Firstpage
    1083
  • Lastpage
    1087
  • Abstract
    This correspondence considers the efficiency of some algorithms for the evaluation of monotonic Boolean functions. It is shown that algorithms based on the criterion of maximizing the local information gain about the Boolean function with n variables may sometimes require a number of computational steps which is n/log n times the computational steps of the optimal algorithm.
  • Keywords
    Binary tree; Boolean; function; monotonic; Algorithm design and analysis; Binary trees; Boolean functions; Computer science; Database languages; Heuristic algorithms; Binary tree; Boolean; function; monotonic;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.1978.1675002
  • Filename
    1675002
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1136255