On the complexity of test case generation for NP-hard problems (Q917311)
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: On the complexity of test case generation for NP-hard problems |
scientific article; zbMATH DE number 4155896
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of test case generation for NP-hard problems |
scientific article; zbMATH DE number 4155896 |
Statements
On the complexity of test case generation for NP-hard problems (English)
0 references
1990
0 references
test case generation
0 references
NP-completeness
0 references
approximation algorithms
0 references
computational complexity
0 references
