Computational complexity of controllability/observability problems for combinational circuits
- 1 June 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 39 (6) , 762-767
- https://doi.org/10.1109/12.53597
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Logic Testing and Design for TestabilityPublished by MIT Press ,1985
- The Complexity of Fault Detection Problems for Combinational Logic CircuitsIEEE Transactions on Computers, 1982
- Polynomially Complete Fault Detection ProblemsIEEE Transactions on Computers, 1975
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971