On the complexity of generating synchronizable test sequences (Q1203646): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate Traveling Salesman Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5187226 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On general routing problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: P-Complete Approximation Problems / rank | |||
Normal rank | |||
Latest revision as of 14:41, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of generating synchronizable test sequences |
scientific article |
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
