On the complexity of computing tests for CMOS gates
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 8 (9) , 973-980
- https://doi.org/10.1109/43.35549
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Computational complexity of controllability/observability problems for combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report)Published by Springer Nature ,1985
- The Complexity of Fault Detection Problems for Combinational Logic CircuitsIEEE Transactions on Computers, 1982
- Fault Modeling and Logic Simulation of CMOS and MOS Integrated CircuitsBell System Technical Journal, 1978