The following pages link to A survey of binary covering arrays (Q540079):
Displaying 16 items.
- Chromatic numbers of copoint graphs of convex geometries (Q397165) (← links)
- Constructions and nonexistence results for suitable sets of permutations (Q507826) (← links)
- Forbidden configurations and repeated induction (Q641192) (← links)
- Attribute-efficient learning of Boolean functions from Post closed classes (Q828191) (← links)
- Partial covering arrays for data hiding and quantization (Q1669914) (← links)
- Parameterized and approximation complexity of \textsc{Partial VC Dimension} (Q1731844) (← links)
- New covering array numbers (Q2010732) (← links)
- Suitable sets of permutations, packings of triples, and Ramsey's theorem (Q2011141) (← links)
- Factorials experiments, covering arrays, and combinatorial testing (Q2071532) (← links)
- Arrays for combinatorial interaction testing: a review on constructive approaches (Q2303506) (← links)
- A survey on the problems and algorithms for covering arrays via set covers (Q2333829) (← links)
- Construction of mixed covering arrays using a combination of simulated annealing and variable neighborhood search (Q2631238) (← links)
- MiTS in Depth: An Analysis of Distinct Tabu Search Configurations for Constructing Mixed Covering Arrays (Q2866118) (← links)
- Suitable Permutations, Binary Covering Arrays, and Paley Matrices (Q3466746) (← links)
- New optimal covering arrays using an orderly algorithm (Q4603878) (← links)
- Non-uniform covering array with symmetric forbidden edge constraints (Q5206931) (← links)
