418 search results - page 4 / 84 » On the Adders with Minimum Tests |
TALG
2008
14 years 9 months ago
2008
Given a Euclidean graph G over a set P of n points in the plane, we are interested in verifying whether G is a Euclidean minimum spanning tree (EMST) of P or G differs from it in ...
97
Voted
FCT
2009
Springer
15 years 4 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...
ICCAD
1992
IEEE
15 years 1 months ago
1992
IEEE
IPL
2007
14 years 9 months ago
2007
75
Voted
ISAAC
2007
Springer
15 years 3 months ago
2007
Springer
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...