The test suite generation problem: optimal instances and their implications
From MaRDI portal
Publication:2381816
DOI10.1016/j.dam.2007.04.010zbMath1129.68048MaRDI QIDQ2381816
Publication date: 19 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.04.010
Related Items
Divisibility of polynomials over finite fields and combinatorial applications, A survey on the problems and algorithms for covering arrays via set covers
Uses Software
Cites Work
- Covering arrays on graphs
- Constructions of \((t,m,s)\)-nets and \((t,s)\)-sequences
- Vector sets for exhaustive testing of logic circuits
- Discrépance de suites associées à un système de numération (en dimension s)
- Covering arrays with mixed alphabet sizes
- Algorithms and Computation
- Mixed covering arrays on graphs
- Orthogonal Arrays of Index Unity
- Geometric discrepancy. An illustrated guide