• DocumentCode
    1114525
  • Title

    An Algorithm for Testing Asummability of Boolean Functions

  • Author

    Sureshchander

  • Author_Institution
    Computer Center. Indian Institute of Technology
  • Issue
    2
  • fYear
    1974
  • Firstpage
    188
  • Lastpage
    191
  • Abstract
    An algorithm is described in this note to determine whether a switching function is asummable or not. The algorithm is efficient and simple for testing 2-asummability.
  • Keywords
    m-asummability, number system, radix, threshold functions, 2-asummability.; Agriculture; Boolean functions; Linear programming; Sufficient conditions; Testing; m-asummability, number system, radix, threshold functions, 2-asummability.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/T-C.1974.223885
  • Filename
    1672478
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1114525