Computational Complexity of Test-Point Insertions and Decompositions
- 24 August 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 233-238
- https://doi.org/10.1109/icvd.1992.658053
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Approximation algorithms for combinatorial problemsPublished by Elsevier ,2007
- CrossCheck-a practical solution for ASIC testabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Computational complexity of controllability/observability problems for combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On polynomial-time testable classes of combinational circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A partitioning method for achieving maximal test concurrency in pseudo-exhaustive testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Tools and devices supporting the pseudo-exhaustive testPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Polynomial time solvable fault detection problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The Complexity of Fault Detection Problems for Combinational Logic CircuitsIEEE Transactions on Computers, 1982
- On Minimal Test Sets for Locating Single Link Failures in NetworksIEEE Transactions on Computers, 1981
- Polynomially Complete Fault Detection ProblemsIEEE Transactions on Computers, 1975