The complexity of Boolean failure identification (Q6903530)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8118137
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of Boolean failure identification |
scientific article; zbMATH DE number 8118137 |
Statements
The complexity of Boolean failure identification (English)
0 references
10 November 2025
0 references
Boolean failure identification
0 references
Boolean network tomography
0 references
group testing
0 references
NP-hardness
0 references
0 references
