Pages that link to "Item:Q1876683"
From MaRDI portal
The following pages link to Problems and algorithms for covering arrays (Q1876683):
Displayed 21 items.
- Optimal locating arrays for at most two faults (Q424251) (← links)
- A formal logic approach to constrained combinatorial testing (Q616856) (← links)
- Hardness results for covering arrays avoiding forbidden edges and error-locating arrays (Q650881) (← links)
- On sizes of complete arcs in \(PG(2,q)\) (Q658122) (← links)
- A survey of methods for constructing covering arrays (Q763563) (← links)
- Automation of broad sanity test generation (Q840076) (← links)
- Constraint models for the covering test problem (Q850459) (← links)
- Roux-type constructions for covering arrays of strengths three and four (Q851777) (← links)
- Tabu search for covering arrays using permutation vectors (Q953845) (← links)
- Underapproximation for model-checking based on universal circuits (Q963058) (← links)
- Constructions of new orthogonal arrays and covering arrays of strength three (Q965209) (← links)
- Covering arrays of strength 3 and 4 from holey difference matrices (Q1009124) (← links)
- Linear hash families and forbidden configurations (Q1009168) (← links)
- Covering arrays avoiding forbidden edges (Q1040583) (← links)
- New upper bounds on the smallest size of a complete arc in a finite Desarguesian projective plane (Q1956326) (← links)
- Mixed covering arrays of strength three with few factors (Q2276196) (← links)
- Locating and detecting arrays for interaction faults (Q2426663) (← links)
- Strength two covering arrays: existence tables and projection (Q2470443) (← links)
- Test sequence construction using minimum information on the tested system (Q2498283) (← links)
- Binary Covering Arrays and Existentially Closed Graphs (Q5322995) (← links)
- A Logic-Based Approach to Combinatorial Testing with Constraints (Q5458811) (← links)