Login / Signup
Polynomial Complexity Algorithms for Increasing the Testability of Digital Circuits by Testing Module Insertion.
Irith Pomeranz
Zvi Kohavi
Published in:
IEEE Trans. Computers (1991)
Keyphrases
</>
digital circuits
computational complexity
high computational complexity
computational cost
worst case
computationally efficient
space complexity
learning algorithm
complexity analysis
lower complexity
significant improvement
optimization problems
theoretical analysis
memory requirements