Issue No. 06 - June (1989 vol. 38)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.24295
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.
detecting sneak paths; transistor networks; sneak paths; minimization of transistor networks; co-NP-complete; minimisation of switching nets.
S. Chakravarty and H. Hunt, III, "A Note on Detecting Sneak Paths in Transistor Networks," in IEEE Transactions on Computers, vol. 38, no. , pp. 861-864, 1989.