Pages that link to "Item:Q851777"
From MaRDI portal
The following pages link to Roux-type constructions for covering arrays of strengths three and four (Q851777):
Displaying 29 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)
- Constructions of covering arrays of strength five (Q663479) (← links)
- D-optimal designs with interaction coverage (Q715797) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Perfect hash families of strength three with three rows from varieties on finite projective geometries (Q887417) (← 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)
- Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
- Randomized post-optimization of covering arrays (Q1761502) (← links)
- In-parameter-order strategies for covering perfect hash families (Q2079142) (← links)
- Consecutive detecting arrays for interaction faults (Q2191274) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- Resolvable covering arrays (Q2320870) (← links)
- Improving two recursive constructions for covering arrays (Q2322060) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
- (Q5241120) (← links)
- Perfect Hash Families: Constructions and Existence (Q5295346) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- An extension of a construction of covering arrays (Q6188123) (← links)
