Partial covering arrays: algorithms and asymptotics (Q726106): Difference between revisions

From MaRDI portal
Merged Item from Q2819525
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: How robust is the n-cube? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering arrays of strength three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3594048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2927763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3195092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive versus nonadaptive attribute-efficient learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Size of Covering Arrays: An Application of Entropy Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner capacities / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>t</i>-Covering Arrays: Upper Bounds and Poisson Approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcube fault-tolerance in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3575007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and algorithms for covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255576 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two applications (for search theory and truth functions) of Sperner type theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of \(k\)-independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5300606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group construction of covering arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank

Revision as of 14:53, 12 July 2024

scientific article; zbMATH DE number 6631040
  • Partial Covering Arrays: Algorithms and Asymptotics
Language Label Description Also known as
English
Partial covering arrays: algorithms and asymptotics
scientific article; zbMATH DE number 6631040
  • Partial Covering Arrays: Algorithms and Asymptotics

Statements

Partial covering arrays: algorithms and asymptotics (English)
0 references
Partial Covering Arrays: Algorithms and Asymptotics (English)
0 references
0 references
0 references
0 references
0 references
3 August 2018
0 references
29 September 2016
0 references
covering arrays
0 references
software interaction testing
0 references
partial covering arrays
0 references
orthogonal arrays
0 references
combinatorial design
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references