The Complexity of Fault Detection Problems for Combinational Logic Circuits (Q3944512)
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: The Complexity of Fault Detection Problems for Combinational Logic Circuits |
scientific article; zbMATH DE number 3761956
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Complexity of Fault Detection Problems for Combinational Logic Circuits |
scientific article; zbMATH DE number 3761956 |
Statements
The Complexity of Fault Detection Problems for Combinational Logic Circuits (English)
0 references
1982
0 references
combinational circuits
0 references
design for testability
0 references
polynomial algorithms
0 references
test generation
0 references
0.819141149520874
0 references
0.782184362411499
0 references
0.7788406610488892
0 references
0.7750397324562073
0 references
0.7747380137443542
0 references
