A note on detecting sneak paths in transistor networks

DOI10.1109/12.24295MaRDI QIDQ5375481zbMATHOpenAlexFDO

Authors Sreejit Chakravarty, H. B. III Hunt

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.24295

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analytic circuit theory (94C05)

Recommendations

• Reversing stealthy dopant-level circuits
• Evasiveness through a circuit lens (extended abstract)
• scientific article; zbMATH DE number 140133
• Finding all elementary circuits exploiting transconductance
• A circuit complexity approach to transductions
• Information-Theoretic Sneak-Path Mitigation in Memristor Crossbar Arrays
• A backtracing-oriented procedure for the analysis of combinational gate-level designs
• A note on circuit graphs

This page was built for publication: A note on detecting sneak paths in transistor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375481)