Pages that link to "Item:Q3150159"
From MaRDI portal
The following pages link to On the state of strength-three covering arrays (Q3150159):
Displayed 18 items.
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- Constraint models for the covering test problem (Q850459) (← 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)
- Constructions of new orthogonal arrays and covering arrays of strength three (Q965209) (← links)
- Covering arrays from cyclotomy (Q970532) (← links)
- Optimal and near-optimal mixed covering arrays by column expansion (Q998340) (← 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)
- Problems and algorithms for covering arrays (Q1876683) (← links)
- Strength two covering arrays: existence tables and projection (Q2470443) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- Bounds for covering codes over large alphabets (Q2572977) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)