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

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Partial Covering Arrays: Algorithms and Asymptotics
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6631040
@@ Property / title @@
+Partial Covering Arrays: Algorithms and Asymptotics (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.68086
@@ Property / zbMATH Open document ID: 1391.68086 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-44543-4_34
@@ Property / DOI: 10.1007/978-3-319-44543-4_34 / rank @@
+Normal rank
@@ Property / published in @@
+Lecture Notes in Computer Science
@@ Property / published in: Lecture Notes in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+September 2016Timestamp +2016-09-29T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2016-09-29T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 29 September 2016 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6631040
@@ Property / zbMATH DE Number: 6631040 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2724359399
@@ Property / OpenAlex ID: W2724359399 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.02131
@@ Property / arXiv ID: 1605.02131 / rank @@
+Normal rank
@@ Property / cites work @@
+How robust is the n-cube?
@@ Property / cites work: How robust is the n-cube? / rank @@
+Normal rank
@@ Property / cites work @@
+On sets of Boolean \(n\)-vectors with all \(k\)-projections surjective
+Normal rank
@@ Property / cites work @@
+Covering arrays of strength three
@@ Property / cites work: Covering arrays of strength three / rank @@
+Normal rank
@@ Property / cites work @@
+Q3594048
@@ Property / cites work: Q3594048 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2927763
@@ Property / cites work: Q2927763 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3195092
@@ Property / cites work: Q3195092 / rank @@
+Normal rank
@@ Property / cites work @@
+Adaptive versus nonadaptive attribute-efficient learning
+Normal rank
@@ Property / cites work @@
+Asymptotic Size of Covering Arrays: An Application of Entropy Compression
+Normal rank
@@ Property / cites work @@
+Sperner capacities
@@ Property / cites work: Sperner capacities / rank @@
+Normal rank
@@ Property / cites work @@
+<i>t</i>-Covering Arrays: Upper Bounds and Poisson Approximations
+Normal rank
@@ Property / cites work @@
+Subcube fault-tolerance in hypercubes
@@ Property / cites work: Subcube fault-tolerance in hypercubes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3575007
@@ Property / cites work: Q3575007 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3374252
@@ Property / cites work: Q3374252 / rank @@
+Normal rank
@@ Property / cites work @@
+Problems and algorithms for covering arrays
@@ Property / cites work: Problems and algorithms for covering arrays / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255576
@@ Property / cites work: Q4255576 / rank @@
+Normal rank
@@ Property / cites work @@
+Two applications (for search theory and truth functions) of Sperner type theorems
+Normal rank
@@ Property / cites work @@
+Families of \(k\)-independent sets
@@ Property / cites work: Families of \(k\)-independent sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q5300606
@@ Property / cites work: Q5300606 / rank @@
+Normal rank
@@ Property / cites work @@
+Group construction of covering arrays
@@ Property / cites work: Group construction of covering arrays / rank @@
+Normal rank
@@ Property / cites work @@
+A constructive proof of the general lovász local lemma
+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

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