57 search results - page 1 / 12 » Why is ATPG Easy |
DAC
1999
ACM
13 years 9 months ago
1999
ACM
MST
2010
13 years 3 months ago
2010
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
ICGA
2006
13 years 5 months ago
2006
SPIRE
2010
Springer
13 years 3 months ago
2010
Springer
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
DATE
2006
IEEE
13 years 11 months ago
2006
IEEE
We present an approach to prevent overtesting in scan-based delay test. The test data is transformed with respect to functional constraints while simultaneously keeping as many po...