Pages that link to "Item:Q1741930"

The following pages link to Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930):

Displaying 13 items.

• On a combinatorial framework for fault characterization (Q1616211) (← links)
• The Lovász local lemma and variable strength covering arrays (Q1742696) (← links)
• In-parameter-order strategies for covering perfect hash families (Q2079142) (← links)
• Algorithmic methods for covering arrays of higher index (Q2103319) (← links)
• Heuristically enhanced IPO algorithms for covering array generation (Q2115896) (← links)
• A greedy-metaheuristic 3-stage approach to construct covering arrays (Q2198200) (← links)
• Improved covering arrays using covering perfect hash families with groups of restricted entries (Q2287570) (← links)
• Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
• Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma (Q2333832) (← links)
• Subspace restrictions and affine composition for covering perfect hash families (Q5198019) (← links)
• Covering schemes of strength \(t\) (Q6063132) (← links)
• Detecting arrays for effects of single factors (Q6086392) (← links)
• An extension of a construction of covering arrays (Q6188123) (← links)