Abstract
In this paper a measure for the complexity of particular instances with respect to a given decision problem is introduced and investigated. Intuitively, an instance x is considered to be hard for a problem A if every algorithm that decides A and runs "fast" on x needs to look up (a description of) x in a table. A main result states that all problems not in P have infinitely many (polynomially) hard instances. Further, there exist problems in EXPTIME with all their instances being hard. The behavior of hard instances under polynomial reductions and the connections with complexity cores and circuits are studied.
Research of this author was supported in part by NSF grants DCR 83-12472 and DCR-8501226; Current address: Department of Mathematics, University of California, Santa Barbara, CA 93106.
Research of this author was supported by the Academy of Finland.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J.L. Balcázar and U. Schöning, Bi-immune sets for complexity classes, Math. Systems Theory 18 (1985), 1–10.
S. Even, A.L. Selman and Y. Yacobi, Hard core theorems for complexity classes, J. Assoc. Comput. Mach. 32 (1985), 205–217.
J. Hartmanis, Generalized Kolmogorov complexity and the structure of feasible computations, Proc. 24th FOCS 1983, 439–445.
J. Hartmanis, On sparse sets in NP, Information Processing Letters 16 (1983), 55–60.
J. Hopcroft and J. Ullman, Introduction to Automata, Lanquaqes, and Computation, Addison-Wesley, 1979.
R. Karp and R. Lipton, Some connections between nonuniform and uniform complexity classes, Proc. 12th ACM Symp. Theory of Computing, 302–309, 1980.
K. Ko, A definition of infinite pseudorandom sequences, manuscript, submitted for publication.
K. Ko, Non-levelable and immune sets in the accepting density hierarchy for NP, Math. Systems Theory 18 (1985), 189–205.
A.N. Kolmogorov, Three approaches to the quantitative definition of information, Prob. Info. Transmission 1 (1965), 1–7.
N. Lynch, On reducibility to complex or sparse sets, J. Assoc. Comput. Mach. 22 (1975), 341–345.
A.M. Meyer and E.M. McCreight, Computationally complex and pseudo-random zero-one valued functions, in: Z. Kohavi and A.Paz (ed.), Theory of Machines and Computations, Academic Press, 1971.
P. Orponen, A classification of complexity core lattices, manuscript, to appear.
P. Orponen, D. Russo and U. Schöning, Optimal approximations and polynomially levelable sets, SIAM Journal on Comput., to appear.
P. Orponen and U. Schöning, The structure of polynomial complexity cores, Proc. 11th Symp. on Math. Found. of Comput. Sci. 1984, Lecture Notes in Computer Science 176, Springer-Verlag, 452–458.
P. Orponen and U. Schöning, The density and complexity of polynomial cores for intractable sets, Information and Control, to appear.
R.E. Wilber, Randomness and the density of hard problems, Proc. 24th FOCS 1983, 335–342.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ko, KI., Orponen, P., Schöning, U., Watanabe, O. (1986). What is a hard instance of a computational problem?. In: Selman, A.L. (eds) Structure in Complexity Theory. Lecture Notes in Computer Science, vol 223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16486-3_99
Download citation
DOI: https://doi.org/10.1007/3-540-16486-3_99
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16486-9
Online ISBN: 978-3-540-39825-7
eBook Packages: Springer Book Archive