Pages that link to "Item:Q3150159"
From MaRDI portal
The following pages link to On the state of strength-three covering arrays (Q3150159):
Displaying 39 items.
- A construction for strength-3 covering arrays from linear feedback shift register sequences (Q404947) (← links)
- A two-stage algorithm for combinatorial testing (Q519759) (← links)
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (Q520418) (← links)
- Covering and radius-covering arrays: constructions and classification (Q708354) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Constraint models for the covering test problem (Q850459) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Augmentation of covering arrays of strength two (Q897271) (← links)
- Constructing new covering arrays from LFSR sequences over finite fields (Q897312) (← 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)
- Improved strength four covering arrays with three symbols (Q1706436) (← links)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- Problems and algorithms for covering arrays (Q1876683) (← links)
- Consecutive detecting arrays for interaction faults (Q2191274) (← links)
- Covering array EXtender (Q2242769) (← 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)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← 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)
- Covering arrays, augmentation, and quilting arrays (Q2920882) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
- Covering schemes of strength \(t\) (Q6063132) (← links)
- Ordered covering arrays and upper bounds on covering codes (Q6086204) (← links)
- Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods (Q6187007) (← links)
- An extension of a construction of covering arrays (Q6188123) (← links)
