The Lovász local lemma and variable strength covering arrays
From MaRDI portal
Publication:1742696
DOI10.1016/j.endm.2018.02.019zbMath1397.90332OpenAlexW2789477863WikidataQ124967081 ScholiaQ124967081MaRDI QIDQ1742696
Brett Stevens, Sebastian Raaphorst, Lucia Moura
Publication date: 12 April 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2018.02.019
Related Items (3)
The Lovász local lemma and variable strength covering arrays ⋮ A construction of variable strength covering arrays ⋮ Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma
Cites Work
- Unnamed Item
- Unnamed Item
- A construction for strength-3 covering arrays from linear feedback shift register sequences
- Asymptotic lower bounds for Ramsey functions
- Asymptotic and constructive methods for covering perfect hash families and covering arrays
- The Lovász local lemma and variable strength covering arrays
- A constructive proof of the general lovász local lemma
- t-Covering Arrays: Upper Bounds and Poisson Approximations
- Covering Array Bounds Using Analytical Techniques
- Upper Bounds on the Size of Covering Arrays
- Asymptotic Size of Covering Arrays: An Application of Entropy Compression
This page was built for publication: The Lovász local lemma and variable strength covering arrays
