Polynomial complexity algorithms for increasing the testability of digital circuits by testing-module insertion (Q5375422)
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: Polynomial complexity algorithms for increasing the testability of digital circuits by testing-module insertion |
scientific article; zbMATH DE number 6937013
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial complexity algorithms for increasing the testability of digital circuits by testing-module insertion |
scientific article; zbMATH DE number 6937013 |
Statements
Polynomial complexity algorithms for increasing the testability of digital circuits by testing-module insertion (English)
0 references
14 September 2018
0 references
