A Note on Detecting Sneak Paths in Transistor Networks

Authors:
S. Chakravarty;H. B. Hunt
Affiliations:
-;-
Venue:
IEEE Transactions on Computers
Year:
1989

Citing 4
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Monotone Boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures

3rd annual symposium on theoretical aspects of computer science on STACS 86
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
LSS: a system for production logic synthesis

IBM Journal of Research and Development

Quantified Score

Hi-index	14.98

Visualization

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.