Hardness and inapproximability of minimizing adaptive distinguishing sequences (Q479811)
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: Hardness and inapproximability of minimizing adaptive distinguishing sequences |
scientific article; zbMATH DE number 6377616
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Hardness and inapproximability of minimizing adaptive distinguishing sequences |
scientific article; zbMATH DE number 6377616 |
Statements
Hardness and inapproximability of minimizing adaptive distinguishing sequences (English)
0 references
5 December 2014
0 references
formal testing
0 references
finite state machine based testing
0 references
state identification
0 references
adaptive distinguishing sequences
0 references
0.8379116
0 references
0.8379116
0 references
0.8356054
0 references
0.8294525
0 references
0.82761943
0 references
0.8254546
0 references
0.82255375
0 references
0.82255375
0 references
