• DocumentCode
    968661
  • Title

    A note on detecting sneak paths in transistor networks

  • Author

    Chakravarty, S. ; Hunt, H.B., III

  • Author_Institution
    Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
  • Volume
    38
  • Issue
    6
  • fYear
    1989
  • fDate
    6/1/1989 12:00:00 AM
  • Firstpage
    861
  • Lastpage
    864
  • Abstract
    The problem of detecting sneak paths in transistor networks arises in the minimization of transistor networks. It is shown that the problem of detecting consistent sneak paths in very simple transistor networks is co-NP-complete
  • Keywords
    minimisation of switching nets; co-NP-complete; detecting sneak paths; minimization of transistor networks; sneak paths; transistor networks; Boolean functions; Computer science; Input variables; Intelligent networks; MOS devices; Polynomials; Tree graphs;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.24295
  • Filename
    24295
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=968661