On the Complexity of Test Case Generation for NP-Hard Problems

Approximation algorithms for NP-hard problems are designed to run efficiently, i.e., in polynomial time for all or at least most instances. They may however fail to provide an answer for some instances or they may provide an approximation rather than the correct answer. We deal with the testing of approximation algorithms that run in polynomial time and that provide a (possibly approximate) answer for each problem instance.

[1]  Juris Hartmanis,et al.  The Boolean Hierarchy I: Structural Properties , 1988, SIAM J. Comput..

[2]  Laura A. Sanchis,et al.  On the Efficient Generation of Language Instances , 1990, SIAM J. Comput..

[3]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[4]  Nancy A. Lynch,et al.  On Reducibility to Complex or Sparse Sets , 1975, JACM.

[5]  Balakrishnan Krishnamurthy,et al.  Constructing Test Cases for Partitioning Heuristics , 1987, IEEE Transactions on Computers.

[6]  Neil Immerman,et al.  Sparse sets in NP-P: Exptime versus nexptime , 1983, STOC.

[7]  Stuart A. Kurtz.  Sparse Sets in NP - P: Relativizations , 1985, SIAM J. Comput..

[8]  Juris Hartmanis,et al.  The Boolean Hierarchy II: Applications , 1989, SIAM J. Comput..

[9]  Richard M. Karp,et al.  FFD bin packing for item sizes with distributions on [0,1/2] , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[10]  Jan Karel Lenstra,et al.  Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[11]  Daniel J. Moore,et al.  Optimization Problems and the Polynomial Hierarchy , 1981, Theor. Comput. Sci..

[12]  Alexander H. G. Rinnooy Kan,et al.  An introduction to the analysis of approximation algorithms , 1986, Discret. Appl. Math..

[13]  Juris Hartmanis.  On Sparse Sets in NP - P , 1983, Inf. Process. Lett..