Pages that link to "Item:Q4715260"

The following pages link to <i>t</i>-Covering Arrays: Upper Bounds and Poisson Approximations (Q4715260):

Displaying 21 items.

• Binary consecutive covering arrays (Q261836) (← links)
• Partial covering arrays: algorithms and asymptotics (Q726106) (← links)
• A survey of methods for constructing covering arrays (Q763563) (← links)
• Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
• Covering arrays from cyclotomy (Q970532) (← links)
• Sign-balanced covering matrices (Q1584386) (← links)
• On a combinatorial framework for fault characterization (Q1616211) (← links)
• Asymptotic and constructive methods for covering perfect hash families and covering arrays (Q1741930) (← links)
• The Lovász local lemma and variable strength covering arrays (Q1742696) (← links)
• Randomized post-optimization of covering arrays (Q1761502) (← links)
• Mixed optimization combinatorial method for constructing covering arrays (Q2017763) (← links)
• Consecutive covering arrays and a new randomness test (Q2266901) (← links)
• Cost-efficient mixed-level covering designs for testing experiments (Q2301219) (← 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)
• Locating and detecting arrays for interaction faults (Q2426663) (← links)
• Strength two covering arrays: existence tables and projection (Q2470443) (← links)
• Partial covering arrays and a generalized Erdös-Ko-Rado property (Q3576974) (← links)
• Upper Bounds on the Size of Covering Arrays (Q5270407) (← links)
• Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
• Covering arrays of higher strength from permutation vectors (Q5471079) (← links)