On the complexity of test case generation for NP-hard problems
type: Item
instance of: scholarly article
title: On the complexity of test case generation for NP-hard problems
zbMATH Open document ID: 0704.68058
DOI: 10.1016/0020-0190(90)90082-9
author: Laura A. Sanchis
published in: Information Processing Letters
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4155896
zbMATH Keywords: test case generation
zbMATH Keywords: NP-completeness
zbMATH Keywords: approximation algorithms
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: 0020-0190(90)90082-9
OpenAlex ID: W2062919621
cites work: The Boolean Hierarchy I: Structural Properties
cites work: The Boolean Hierarchy II: Applications
cites work: Q4198056
cites work: On sparse sets in NP-P
cites work: Sparse Sets in : Relativizations
cites work: Optimization problems and the polynomial hierarchy
cites work: On Reducibility to Complex or Sparse Sets
cites work: The complexity of facets (and some facets of complexity)
cites work: An introduction to the analysis of approximation algorithms
cites work: On the Efficient Generation of Language Instances
description: scientific article; zbMATH DE number 4155896