Pages that link to "Item:Q5270407"

The following pages link to Upper Bounds on the Size of Covering Arrays (Q5270407):

Displaying 10 items.

• Partial covering arrays: algorithms and asymptotics (Q726106) (← 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)
• Do judge a test by its cover. Combining combinatorial and property-based testing (Q2233461) (← links)
• Directed Lovász local lemma and Shearer's lemma (Q2294597) (← 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)
• A note on the \(k\)-restriction problem (Q6602326) (← links)
• An algorithmic construction of union-intersection-bounded families (Q6615223) (← links)