The following pages link to On \(t\)-covering arrays (Q1877364):
Displaying 28 items.
- Constructing heterogeneous hash families by puncturing linear transversal designs (Q408964) (← links)
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (Q520418) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Constructing strength three covering arrays with augmented annealing (Q924952) (← links)
- Tabu search for covering arrays using permutation vectors (Q953845) (← links)
- Covering arrays from cyclotomy (Q970532) (← links)
- Explicit constructions for perfect hash families (Q1008968) (← links)
- Covering arrays of strength 3 and 4 from holey difference matrices (Q1009124) (← links)
- Linear hash families and forbidden configurations (Q1009168) (← links)
- Merging covering arrays and compressing multiple sequence alignments (Q1026121) (← links)
- Covering \(t\)-element sets by partitions (Q1180794) (← links)
- On the covering of \(t\)-sets with \((t+1)\)-sets: \(C(9,5,4)\) and \(C(10,6,5)\) (Q1182924) (← links)
- Covering arrays from \(m\)-sequences and character sums (Q1675282) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- Mixed optimization combinatorial method for constructing covering arrays (Q2017763) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- Distributing hash families with few rows (Q2333821) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Recursive constructions for \(t\)-covering arrays (Q2887176) (← links)
- (Q3594048) (← links)
- On t-fold covers of coherent configurations (Q4577878) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- Detecting arrays for effects of single factors (Q6086392) (← links)
