Sequence Covering Arrays and Linear Extensions
From MaRDI portal
Publication:2946063
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
- scientific article; zbMATH DE number 4211968 (Why is no real title available?)
- A Geometric Approach to Betweenness
- A note on scrambling permutations
- An extremal problem of \(d\) permutations containing every permutation of every \(t\) elements
- Boxicity and separation dimension
- Concerning a Certain Set of Arrangements
- Containment problems in high-dimensional spaces
- Counting linear extensions
- Dimensions of hypergraphs
- Directed t-packings and directed t-Steiner systems
- Fast perfect sampling from linear extensions
- Generating event-sequence test cases by answer set programming with the incidence matrix
- Minimal scrambling sets of simple orders
- On the conductance of order Markov chains
- On the minimum number of completely 3-scrambling permutations
- Randomized Post-optimization for t-Restrictions
- Randomized post-optimization of covering arrays
- Scrambling permutations and entropy of hypergraphs
- Sequence covering arrays
- Total Ordering Problem
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)
