Sequence Covering Arrays and Linear Extensions
From MaRDI portal
Publication:2946063
DOI10.1007/978-3-319-19315-1_24zbMATH Open1401.05051OpenAlexW2294159173MaRDI QIDQ2946063FDOQ2946063
Authors: Patrick Murray, Charles J. Colbourn 
Publication date: 15 September 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_24
Recommendations
- Sequence covering arrays
- On perfect sequence covering arrays
- Perfect sequence covering arrays
- Covering arrays from \(m\)-sequences and character sums
- scientific article; zbMATH DE number 3485886
- Recursive constructions of covering arrays
- Linear spaces of sequences
- Covering arrays via set covers
- Binary consecutive covering arrays
- Covering the integers by arithmetic sequences
Cites Work
- Counting linear extensions
- Total Ordering Problem
- A note on scrambling permutations
- Scrambling permutations and entropy of hypergraphs
- Sequence covering arrays
- Minimal scrambling sets of simple orders
- Concerning a Certain Set of Arrangements
- Dimensions of hypergraphs
- Directed \(t\)-packings and directed \(t\)-Steiner systems
- Fast perfect sampling from linear extensions
- A Geometric Approach to Betweenness
- Title not available (Why is that?)
- On the conductance of order Markov chains
- Boxicity and separation dimension
- Randomized post-optimization of covering arrays
- An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
- Containment problems in high-dimensional spaces
- On the minimum number of completely 3-scrambling permutations
- Randomized Post-optimization for t-Restrictions
- Generating event-sequence test cases by answer set programming with the incidence matrix
Cited In (6)
This page was built for publication: Sequence Covering Arrays and Linear Extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946063)
