Instance Complexity

Journal of the ACM (JACM)

Volumn 41, Issue 1, 1994, Pages 96-121

  Orponen, Pekka ^a   Ko, Ker I ^b   Schöning, Uwe ^c   Watanabe, Osamu ^d  

^a UNIVERSITY OF HELSINKI   (Finland)

^b STONY BROOK UNIVERSITY   (United States)

^c Umversltat Ulm ^*  (Germany)

^d TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

completeness; Kolmogorov complexity; nonuniform complexity; paddability; self reducibility

Indexed keywords

ALGORITHMS; DECISION THEORY; ENCODING (SYMBOLS); FUNCTION EVALUATION; POLYNOMIALS; RECURSIVE FUNCTIONS; SET THEORY;

COMPLETENESS; FINITE VARIATION; INSTANCE COMPLEXITY; KOLMOGOROV COMPLEXITY; NONUNIFORM COMPLEXITY; PADDABILITY; RECURSIVE SET; SELF REDUCIBILITY;

COMPUTATIONAL COMPLEXITY;

EID: 0028322833     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/174644.174648     Document Type: Article

References (31)

1. ARVIND, V., HAN, Y., HEMACHANDRA, L., KÖBLER, J., MUNDHENK, M., SCHÖNING, U., THIERAUF, T., LOZANO, A., OGIWARA, M., AND SILVESTRI, R. 1992. Reductions to sets of low information content. In Proceedings of the 19th International Colloquium on Automata, Languages, and Programming (Vienna, Austria, July). Lecture Notes in Computer Science, vol. 623. Springer-Verlag, Berlin, Germany, pp. 162-173.
2. BALCÁZAR, J. L., DÍAZ, J., AND GABARRÓ, J. 1988 Structural Complexity I. Springer-Verlag, Berlin, Germany.
3. BALCÁZAR, J. L., AND SCHONING, U. 1985. Bi-immune sets for complexity classes. Math. Syst. Theory 18, 1-10.
4. BERMAN. L. 1977. Polynomial reducibilities and complete sets. Ph.D. dissertation. Cornell Univ., Ithaca, N.Y.
5. BOOK, R. V. 1974. Tally languages and complexity classes. Inf. Contr. 26, 186-193.
6. BOOK, R., DU, D.-Z., AND Russo, D. A. 1988. On polynomial and generalized complexity cores. In Proceedings of the 3rd Annual Symposium on Structure in Complexity Theory (Washington, D.C, June). IEEE, New York, pp. 236-250.
7. CHAITIN, G. J. 1969. On the simplicity and speed of programs for computing infinite sets of natural numbers. J. ACM 16 3 (July), 407-422. (Reprinted in CHAITIN, G. J. Information Randomness & Incompleteness-Papers on Algorithmic Information Theory. World Scientific, Singapore. 1987, pp. 256-272).
8. EVEN, S., SELMAN, A. L., AND YACOBI, Y. 1985. Hard-core theorems for complexity classes. J. A.C.M. 32, 1 (Jan.) 205-217.
9. FLAJOLET, P., AND STEYAERT, J. M. 1974. On sets having only hard subsets. In Proceedings of the 2nd International Colloquium on Automata, Languages, and Programming (Saarbrücken, July). Lecture Notes in Computer Science, vol. 14. Springer-Verlag, Berlin, Germany, pp. 446-457.
10. HARTMANIS, J. 1983. Generalized Kolmogorov complexity and the structure of feasible computations. In Proceedings of the 24th Annual Symposium on the Foundations of Computer Science (Tucson, Az., Nov.). IEEE, New York. pp. 439-445.
11. HARTMANIS, J. 1983. On sparse sets in NP. Inf. Proc. Lett. 16, 55-60.
12. HOPCROFT, J. E., AND ULLMAN, J. D. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, Mass.
13. JAZAYERI, M., OGDEN, W. F., AND ROUNDS, W. C. 1975. The intrinsically exponential complexity of the circularity problem for attribute grammars. Commun. ACM 18, 12 (Dec.) 697-706.
14. KARP, R. M., AND LIPTON, R. J. 1980. Some connections between nonuniform and uniform complexity classes. In Proceedings of the 12th Annual ACM Symposium on Theory of Computing (Los Angeles, Calif, Apr. 28-30). ACM, New York, pp. 302-309.
15. KO, K.-I. 1985. Non-levelable and immune sets in the accepting density hierarchy for NP. Math. Systems Theory 18, 189-205.
16. KO, K.-I. 1986. On the notion of infinite pseudorandom sequences. Theoret. Comput. Sci. 48, 9-33.
17. KO, K.-I. 1992. A note on the instance complexity of pseudorandom sets. In Proceedings of the 7th Annual Symposium on Structure in Complexity Theory (Boston, Mass, June). IEEE, New York, pp. 327-337.
18. KOLMOGOROV, A. N. 1965. Three approaches to the quantitative definition of information. Prob. Inf. Trans. 1, 1-7.
19. LI, M., AND VITÁNYI, P. M. B. 1990. Kolmogorov complexity and its applications. In Handbook of Theoretical Computer Science. Vol. A. Algorithms and Complexity, J. van Leeuwen, ed. Elsevier, Amsterdam, The Netherlands, pp. 187-254.
20. LOVELAND, D. W. 1969. A variant of the Kolmogorov concept of complexity. Inf. Cont. 15, 510-526.
21. LYNCH, N. 1975. On reducibility to complex or sparse sets. J. ACM 22, 3 (July) 341-345.
22. MEYER, A. M., AND MCCREIGHT, E. M. 1971. Computationally complex and pseudorandom zero-one valued functions. In Theory of Machines and Computations (Haifa, Israel, Aug.), Z. Kohavi and A. Paz, eds. Academic Press, Orlando, Fla., pp. 19-42.
23. MEYER, A. M., AND PATERSON, M. P. 1979. With what frequency are apparently intractable problems difficult? Tech. Rep. TM-126, Lab. Comput. Sci., MIT, Cambridge, Mass.
24. ORPONEN, P. 1986. A classification of complexity core lattices. Theoret. Comput. Sci. 47, 121-130.
25. ORPONEN, P., RUSSO, D. A., AND SCHÖNING, U. 1986. Optimal approximations and polynomially levelable sets. SIAM J. Comput. 15, 399-408.
26. ORPONEN, P., AND SCHÖNING, U. 1986. The density and complexity of polynomial cores for intractable sets. Inf. Contr. 70 54-68.
27. ROGERS, H., JR. 1967. Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York.
28. SCHNORR, C. P. 1976. Optimal algorithms for self-reducible problems. In Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming (Edinburgh, Scotland, July). Edinburgh Univ. Press, Edinburgh, Scotland, pp. 322-337.
29. SIPSER, M. 1983. A complexity theoretic approach to randomness. In Proceedings of the 15th Annual ACM Symposium on Theory of Computing (Boston, Mass., Apr. 25-27). ACM, New York, pp. 330-335.
30. WATANABE, O. 1985. On one-one polynomial time equivalence relations. Theoret. Comput. Sci. 38 157-165.
31. WILBER, R. E. 1983. Randomness and the density of hard problems. In Proceedings of the 24th Annual Symposium on the Foundations of Computer Science (Tucson, Az., Nov.). IEEE, New York, pp. 335-342.