Easy sets and hard certificate schemes

Acta Informatica

Volumn 34, Issue 11, 1997, Pages 859-879

  Hemaspaandra, Lane A ^a   Rothe, Jörg ^b   Wechsung, Gerd ^b  

^a University of Rochester   (United States)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS;

KOLMOGOROV COMPLEXITY;

SET THEORY;

EID: 0031269021     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050109     Document Type: Article

References (35)

1. L. Adleman. Time, space, and randomness. Technical Report MIT/LCS/TM-131, MIT, Cambridge, MA, April 1979.
2. E. Allender. Oracles versus proof techniques that do not relativize. In Proceedings of the 1990 SIGAL International Symposium on Algorithms, pages 39-52. Springer-Verlag Lecture Notes in Computer Science #450, August 1990.
3. E. Allender. Applications of time-bounded Kolmogorov complexity in complexity theory. In O. Watanabe, editor, Kolmogorov Complexity and Computational Complexity, EATCS Monographs on Theoretical Computer Science, pages 4-22. Berlin, Heidelberg, New York: Springer 1992.
4. E. Allender, R. Rubinstein. P-printable sets. SIAM Journal on Computing, 17:1193-1202, 1988.
5. J. Balcázar, R. Book. Sets with small generalized Kolmogorov complexity. Acta Informatica, 23(6):679-688, 1986.
6. D. Bovet, P. Crescenzi. Introduction to the Theory of Complexity. Prentice Hall, 1993.
7. A. Borodin, A. Demers. Some comments on functional self-reducibility and the NP hierarchy. Technical Report TR 76-284, Cornell Department of Computer Science, Ithaca, NY, July 1976.
8. [BDG] J. Balcázar, J. Díaz, J. Gabarró. Structural Complexity. Springer-Verlag, Vol. 1 (1988), Vol. 2 (1990).
9. T. Baker, J. Gill, R. Solovay. Relativizations of the P=?NP question. SIAM Journal on Computing. 4:431-442, 1975.
10. J. Cai, L. Hemachandra. Enumerative counting is hard. Information and Computation, 82(1):34-44, 1989.
11. G. Chaitin. On the length of programs for computing finite binary sequences. Journal of the ACM, 13:547-569, 1966.
12. S. Fenner, L. Fortnow, A. Naik, J. Rogers. On inverting onto functions. In Proceedings of the 11th Annual IEEE Conference on Computational Complexity, pages 213-222. IEEE Computer Society Press, May 1996.
13. L. Fortnow. The role of relativization in complexity theory. Bulletin of the EATCS, (52):229-244, 1994.
14. L. Fortnow, J. Rogers. Separability and one-way functions. In Proceedings of the 5th International Symposium on Algorithms and Computation, pages 396-404. Springer-Verlag Lecture Notes in Computer Science #834, August 1994.
15. F. Green, J. Torán. Kolmogorov complexity of #P functions. Manuscript, 1991.
16. J. Hartmanis. Generalized Kolmogorov complexity and the structure of feasible computations. In Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pages 439-445. IEEE Computer Society Press, 1983.
17. J. Hartmanis. Solvable problems with conflicting relativizations. Bulletin of the EATCS, 27:40-49, 1985.
18. J. Hartmanis, L. Hemachandra. On sparse oracles separating feasible complexity classes. Information Processing Letters, 28:291-295, 1988.
19. L. Hemachandra, S. Rudich. On the complexity of ranking. Journal of Computer and System Sciences, 41(2):251-271, 1990.
20. J. Hopcroft, J. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
21. L. Hemachandra, G. Wechsung. Kolmogorov characterizations of complexity classes. Theoretical Computer Science, 83:313-322, 1991.
22. J. Hartmanis, Y. Yesha. Computation times of NP sets of different densities. Theoretical Computer Science, 34:17-32, 1984.
23. A. Kolmogorov. Three approaches for defining the concept of information quantity. Problems Information Transmission, 1:1-7, 1965.
24. S. Kurtz. A relativized failure of the Berman-Hartmanis conjecture. Technical Report TR83-001, University of Chicago Department of Computer Science, Chicago, IL, 1983.
25. R. Ladner. On the structure of polynomial time reducibility. Journal of the ACM, 22(1):155-171, 1975.
26. L. Levin. Universal sorting problems. Problems of Information Transmission, 9:265-266, 1973.
27. L. Levin. Randomness conservation inequalities; information and independence in mathematical theories. Information and Control, 61:15-37, 1984.
28. M. Li, P. Vitányi. Applications of Kolmogorov complexity in the theory of computation. In A. Selman, ed., Complexity Theory Retrospective, pages 147-203. Berlin, Heidelberg, New York: Springer 1990.
29. C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
30. C. Rackoff. Relativized questions involving probabilistic algorithms. Journal of the ACM, 29(1):261-268, 1982.
31. R. Rubinstein. A note on sets with small generalized Kolmogorov complexity. Technical Report TR86-4, Iowa State University, Ames, IA, March 1986.
32. A. Selman. Natural self-reducible sets. SIAM Journal on Computing, 17(5):989-996, 1988.
33. A. Selman. Personal Communication, May, 1995.
34. M. Sipser. A complexity theoretic approach to randomness. In Proceedings of the 15th ACM Symposium on Theory of Computing, pages 330-335, 1983.
35. B. Trakhtenbrot. A survey of Russian Approaches to perebor (brute-force search) algorithms. Annals of the History of Computing, 6(4):384-400, 1984.