Abstract
Recently, Osamu Watanabe proposed a new framework for testing the correctness and average case behavior of algorithms that purport to solve a given NP search problem efficiently on average. The idea is to randomly generate certified instances in a way that resembles the underlying distribution μ. We discuss this approach and show that test instances can be generated for every NP search problem with non-adaptive queries to an NP oracle. Further, we introduce Las Vegas as well as Monte Carlo types of test instance generators. We show that these generators can be used to find out whether an algorithm is correct and efficient on average under μ. In fact, it is not hard to construct Monte Carlo generators for all RP search problems as well as Las Vegas generators for all ZPP search problems. On the other hand, we prove that (under the uniform distribution) Monte Carlo generators can only exist for problems in NP ∩ co-AM.
Supported by the Deutsche Forschungsgemeinschaft, research grant Schö 302/4-2.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi, J. Feigenbaum, and J. Kilian. On hiding information from an oracle. Journal of Computer and System Sciences, 39:21–50, 1989.
J.L. Balcázar. Self-reducibility structures and solutions of NP problems. In Revista Matematica, volume 2, pages 175–184. Universidad Complutense de Madrid, 1989.
S. Ben-David, B. Chor, O. Goldreich, and M. Luby. On the theory of average case complexity. Journal of Computer and System Sciences, 44(2):193–219, 1992.
A. Borodin and A. Demers. Some comments on functional self-reducibility and the NP hierarchy. Technical Report 76-284, Dept. of Computer Science, Cornell University, 1976.
J.L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity II. Springer-Verlag, 1990.
J.L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, second edition, 1995.
A. Blass and Y. Gurevich. Randomized reductions of search problems. SIAM Journal of Computing, 22:949–975, 1993.
R.B. Boppana, J. Hastad, and S. Zachos. Does co-NP have short interactive proofs? Information Processing Letters, 25:27–32, 1987.
L. Babai and S. Moran. Arthur-Merlin games: A randomized proof system, and a short hierarchy of complexity classes. Journal of Computer and System Sciences, 36:254–276, 1988.
R.V. Book. Tally languages and complexity classes. Information and Control, 26:281–287, 1974.
J.L. Carter and M.N. Wegman. Universal classes of hash functions. Journal of Computer and System Sciences, 18:143–154, 1979.
Y. Gurevich. Average case complexity. Journal of Computer and System Sciences, 42(3):346–398, 1991.
K.-I. Ko and H. Friedman. Computational complexity of real functions. Theoretical Computer Science, 20:323–352, 1982.
J. Köbler, U. Schöning, and J. Torán. The Graph Isomorphism Problem: It's Structural Complexity. Birkhäuser, 1993.
L.A. Levin. Average case complete problems. SIAM Journal of Computing, 15:285–286, 1986.
A. Lozano and J. Torán. On the nonuniform complexity of the graph isomorphism problem. In K. Ambos-Spies, S. Homer, and U. Schöning, editors, Complexity Theory—Current Research, pages 245–271. Cambridge University Press, 1993.
C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
L.A. Sanchis. Language instance generation and test case construction for NP-hard problems. Technical Report 296, University of Rochester, Dept. of Computer Science, 1989.
C.P. Schnorr. Optimal algorithms for self-transformable problems. In Proc. 3th International Colloquium on Automata, Languages and Programming, 1976.
U. Schöning. Graph isomorphism is in the low hierarchy. Journal of Computer and System Sciences, 37:312–323, 1988.
M. Sipser. A complexity theoretic approach to randomness. In Proc. 15th ACM Symposium on the Theory of Computing, pages 330–335, 1983.
W. Tompa and H. Woll. Random self-reducibility and zero-knowledge interactive proofs of possession of information. In Proc. 28st Symposium on Foundations of Computer Science, pages 472–482, 1987.
L.G. Valiant and V.V. Vazirani. NP is as easy as detecting unique solutions. Theoretical Computer Science, 47:85–93, 1986.
J. Wang. Average-case computational complexity theory. In A. Selman and L. Hemaspaandra, editors, Complexity Theory Retrospective II. Springer-Verlag. (to appear).
O. Watanabe. Test instance generation for promised NP search problems. In Proc. 9th Conference on Structure in Complexity Theory, pages 205–216, 1994.
J. Wang and J. Belanger. On the NP-isomorphism problem with respect to random instances. Journal of Computer and System Sciences, 50:151–164, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karg, C., Köbler, J., Schuler, R. (1997). The complexity of generating test instances. In: Reischuk, R., Morvan, M. (eds) STACS 97. STACS 1997. Lecture Notes in Computer Science, vol 1200. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023474
Download citation
DOI: https://doi.org/10.1007/BFb0023474
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62616-9
Online ISBN: 978-3-540-68342-1
eBook Packages: Springer Book Archive