Max-throughput for (conservative) \(k\)-of-\(n\) testing (Q513287)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Max-throughput for (conservative) \(k\)-of-\(n\) testing |
scientific article; zbMATH DE number 6691866
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Max-throughput for (conservative) \(k\)-of-\(n\) testing |
scientific article; zbMATH DE number 6691866 |
Statements
Max-throughput for (conservative) \(k\)-of-\(n\) testing (English)
0 references
3 March 2017
0 references
\(k\)-of-\(n\) testing
0 references
maximum throughput
0 references
sequential testing
0 references
0 references
0 references
