• DocumentCode
    1111120
  • Title

    A Lower Bound on the Complexity of Arbitrary Switching Function Realizers

  • Author

    Hansalik, William E.

  • Author_Institution
    Univac Division, Sperry Rand Corporation
  • Issue
    5
  • fYear
    1972
  • fDate
    5/1/1972 12:00:00 AM
  • Firstpage
    507
  • Lastpage
    510
  • Abstract
    In this note, arbitrary switching function realizers and their complexity are defined. Then, a lower bound on the complexity is derived in terms of the number of such switching function realizers required to realize all Boolean functions of n variables.
  • Keywords
    Bound, complexity, function, realization, switching.; Boolean functions; Circuit synthesis; Electrons; Isobaric; Logic; Network synthesis; Physics; Switches; Switching circuits; Testing; Bound, complexity, function, realization, switching.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

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