Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms (Q3661287)
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: Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms |
scientific article; zbMATH DE number 3813325
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms |
scientific article; zbMATH DE number 3813325 |
Statements
Minimizing the Average Cost of Testing Coherent Systems: Complexity and Approximate Algorithms (English)
0 references
1983
0 references
optimal testing policy
0 references
s-coherent system
0 references
computational complexity
0 references
polynomial-time algorithm
0 references
approximate algorithms
0 references
state determination
0 references
