On the complexity of test case generation for NP-hard problems
- 1 November 1990
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 36 (3), 135-140
- https://doi.org/10.1016/0020-0190(90)90082-9
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- On the Efficient Generation of Language InstancesSIAM Journal on Computing, 1990
- The Boolean Hierarchy II: ApplicationsSIAM Journal on Computing, 1989
- The Boolean Hierarchy I: Structural PropertiesSIAM Journal on Computing, 1988
- Constructing Test Cases for Partitioning HeuristicsIEEE Transactions on Computers, 1987
- An introduction to the analysis of approximation algorithmsDiscrete Applied Mathematics, 1986
- Sparse Sets in : RelativizationsSIAM Journal on Computing, 1985
- The complexity of facets (and some facets of complexity)Journal of Computer and System Sciences, 1984
- On sparse sets in NP–PInformation Processing Letters, 1983
- Optimization problems and the polynomial hierarchyTheoretical Computer Science, 1981
- On Reducibility to Complex or Sparse SetsJournal of the ACM, 1975