On the complexity of generating synchronizable test sequences (Q1203646)
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 120254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of generating synchronizable test sequences |
scientific article; zbMATH DE number 120254 |
Statements
On the complexity of generating synchronizable test sequences (English)
0 references
22 February 1993
0 references
test sequence generation
0 references
conformance testing
0 references
approximation algorithm
0 references
protocol engineering
0 references
minimum-cost synchronizable test sequence
0 references
\(NP\)- hard
0 references
0.8521100878715515
0 references
0.7789661884307861
0 references
0.7789661884307861
0 references
0.7270522713661194
0 references
0.7139129638671875
0 references
