This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Note on Detecting Sneak Paths in Transistor Networks
June 1989 (vol. 38 no. 6)
pp. 861-864
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.

[1] A. V. Aho, R. Sethi, and J. D. Ullman,Compilers: Principles, Techniques, and Tools. Reading, MA: Addison-Wesley, 1986.
[2] D. Brandt, "Detecting sneak paths in transistor networks,"IEEE Trans. Comput., vol. C-35, pp. 274-278, Mar. 1986.
[3] J. A. Darringer, D. Brandt, J. V. Gerbi, W. H. Joyner, Jr., and L. Trevillyan, "LSS: A system for production logic synthesis,"IBM J. Res. Develop., vol. 28, pp. 537-545.
[4] M. R. Garey and D. S. Johnson,Computers and Intractability: A Guide to Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
[5] H. B. Hunt III and R. E. Stearns, "Monotone Boolean formulae, distributive lattices, and the complexity of logics, algebraic structures, and computation structures," inProc. STACS86, 3rd Annu. Symp. Theoret. Aspects Comput. Sci., vol. 210, B. Monien and G. Vidal-Naquet, Eds. Berlin, Germany, Springer-Verlag, 1986, pp. 282-291.
[6] R. E. Miller, "Formal analysis and synthesis of bilateral switching networks,"IRE Trans. Electron. Comput., vol. EC-7, pp. 231- 244. Sept. 1958.

Index Terms:
detecting sneak paths; transistor networks; sneak paths; minimization of transistor networks; co-NP-complete; minimisation of switching nets.
Citation:
S. Chakravarty, H.B. Hunt, III, "A Note on Detecting Sneak Paths in Transistor Networks," IEEE Transactions on Computers, vol. 38, no. 6, pp. 861-864, June 1989, doi:10.1109/12.24295
Usage of this product signifies your acceptance of the Terms of Use.