Partitioning 1-variable Boolean functions for various classification of n -variable Boolean functions.

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
Read Online Read More Add to Saved list
  • Additional Information
    • Subject Terms:
      BOOLEAN functions; CLASSIFICATION algorithms; MATHEMATICAL variables; SET theory; HAMMING distance
    • Abstract:
      This paper addresses all possible equivalence classes of 1-variable Boolean functions and from these classes using recursion and Cartesian product of sets, 15 different ways of classifications ofn-variable Boolean functions are obtained. The properties with regard to the size and the number of classes for these 15 different ways are also elaborated. [ABSTRACT FROM AUTHOR]
    • Abstract:
      Copyright of International Journal of Computer Mathematics is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)