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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 7 users not shown)
aliases / en / 0aliases / en / 0
 
Partial Covering Arrays: Algorithms and Asymptotics
description / endescription / en
scientific article
scientific article; zbMATH DE number 6631040
Property / title
 
Partial Covering Arrays: Algorithms and Asymptotics (English)
Property / title: Partial Covering Arrays: Algorithms and Asymptotics (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1391.68086 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-44543-4_34 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
29 September 2016
Timestamp+2016-09-29T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 29 September 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6631040 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963856226 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2724359399 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1605.02131 / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning of juntas from membership queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Two-Stage Algorithms for Group Testing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on the Size of Covering Arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two combinatorial covering theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank

Latest revision as of 05:43, 16 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