860 search results - page 2 / 172 » Lower Bounds on the Size of Test Data Sets |
COCO
2003
Springer
14 years 25 days ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We study practically efficient methods for performing combinatorial group testing. We present efficient non-adaptive and two-stage combinatorial group testing algorithms, which i...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
ISAAC
2007
Springer
14 years 1 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 ...
VLSID
2006
IEEE
14 years 1 months ago
2006
IEEE
The main result of this paper, proved as a theorem, is that a lower bound on the number of test vectors that detect each fault at least N times is N