The following pages link to Covering arrays of strength three (Q1299897):
Displaying 20 items.
- Optimum super-simple mixed covering arrays of type \(a^1 b^{k-1}\) (Q520418) (← links)
- Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
- Cover starters for covering arrays of strength two (Q764881) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Constructing strength three covering arrays with augmented annealing (Q924952) (← 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)
- Problems and algorithms for covering arrays (Q1876683) (← links)
- New covering array numbers (Q2010732) (← links)
- Consecutive detecting arrays for interaction faults (Q2191274) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Covering arrays on product graphs (Q2409504) (← links)
- Mixed covering arrays on 3-uniform hypergraphs (Q2410218) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Covering arrays on graphs (Q2565691) (← links)
- On the state of strength-three covering arrays (Q3150159) (← links)
- Mixed covering arrays on graphs of small treewidth (Q5063252) (← links)
- Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
- An extension of a construction of covering arrays (Q6188123) (← links)
- A note on the \(k\)-restriction problem (Q6602326) (← links)
