A note on detecting sneak paths in transistor networks

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.< >

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on computers 1989-06, Vol.38 (6), p.861-864
Hauptverfasser:	Chakravarty, S., Hunt, H.B.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Boolean functions Computer science Electronics Exact sciences and technology Input variables Intelligent networks MOS devices Polynomials Semiconductor electronics. Microelectronics. Optoelectronics. Solid state devices Transistors Tree graphs
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!