In-parameter-order strategies for covering perfect hash families
From MaRDI portal
Publication:2079142
DOI10.1016/j.amc.2022.126952OpenAlexW4210300272MaRDI QIDQ2079142
Publication date: 4 March 2022
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2022.126952
Mathematical programming (90Cxx) Discrete mathematics in relation to computer science (68Rxx) Designs and configurations (05Bxx)
Related Items (1)
Uses Software
Cites Work
- Covering and radius-covering arrays: constructions and classification
- Roux-type constructions for covering arrays of strengths three and four
- Constructing strength three covering arrays with augmented annealing
- Tabu search for covering arrays using permutation vectors
- Covering arrays from cyclotomy
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- Covering arrays of strength three from extended permutation vectors
- Sliced AETG: a memory-efficient variant of the AETG covering array generation algorithm
- A greedy-metaheuristic 3-stage approach to construct covering arrays
- Improved covering arrays using covering perfect hash families with groups of restricted entries
- A survey on the problems and algorithms for covering arrays via set covers
- Algebraic Modelling of Covering Arrays
- Subspace restrictions and affine composition for covering perfect hash families
- Covering arrays of higher strength from permutation vectors
This page was built for publication: In-parameter-order strategies for covering perfect hash families