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

Latest revision as of 10:49, 31 December 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

instance of

scholarly article

0 references

title

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

Theory of Computing Systems

0 references

Lecture Notes in Computer Science

0 references

publication date

3 August 2018

0 references

29 September 2016

0 references

full work available at URL

https://arxiv.org/abs/1605.02131

0 references

zbMATH Keywords

covering arrays

0 references

software interaction testing

0 references

partial covering arrays

0 references

orthogonal arrays

0 references

combinatorial design

0 references

MaRDI profile type

Publication

0 references

cites work

How robust is the n-cube?

0 references

On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective

0 references

Covering arrays of strength three

0 references

Q3594048

0 references

Q2927763

0 references

Q3195092

0 references

Adaptive versus nonadaptive attribute-efficient learning

0 references

Asymptotic Size of Covering Arrays: An Application of Entropy Compression

0 references

Sperner capacities

0 references

<i>t</i>-Covering Arrays: Upper Bounds and Poisson Approximations

0 references

Subcube fault-tolerance in hypercubes

0 references

Q3575007

0 references

Q3374252

0 references

Problems and algorithms for covering arrays

0 references

Q4255576

0 references

Two applications (for search theory and truth functions) of Sperner type theorems

0 references

Families of \(k\)-independent sets

0 references

Q5300606

0 references

Group construction of covering arrays

0 references

A constructive proof of the general lovász local lemma

0 references

Q3503433

0 references

Exact learning of juntas from membership queries

0 references

Optimal Two-Stage Algorithms for Group Testing Problems

0 references

Approximation algorithms for combinatorial problems

0 references

Extremal Combinatorics

0 references

On the ratio of optimal integral and fractional covers

0 references

Upper Bounds on the Size of Covering Arrays

0 references

Two combinatorial covering theorems

0 references

Q2921715

0 references

Q4782696

0 references

Identifiers

zbMATH Open document ID

1391.68085

0 references

1391.68086

0 references

DOI

10.1007/978-3-319-44543-4_34

0 references

10.1007/S00224-017-9782-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:726106

@@ Property / DOI @@
-.1007/s00224-017-9782-9
@@ Property / DOI: 10.1007/s00224-017-9782-9 / rank @@
-Normal rank
@@ Property / DOI @@
+.1007/S00224-017-9782-9
@@ Property / DOI: 10.1007/S00224-017-9782-9 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3503433
@@ Property / cites work: Q3503433 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact learning of juntas from membership queries
@@ Property / cites work: Exact learning of juntas from membership queries / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Two-Stage Algorithms for Group Testing Problems
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Extremal Combinatorics
@@ Property / cites work: Extremal Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Upper Bounds on the Size of Covering Arrays
@@ Property / cites work: Upper Bounds on the Size of Covering Arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Two combinatorial covering theorems
@@ Property / cites work: Two combinatorial covering theorems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2921715
@@ Property / cites work: Q2921715 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank