Upper bounds for the complexity of sparse and tally descriptions

Mathematical Systems Theory

Volumn 29, Issue 1, 1996, Pages 63-94

  Arvind, V ^a   Kobler J ^b   Mundhenk, M ^c  

^a INSTITUTE OF MATHEMATICAL SCIENCES   (India)

^b UNIVERSITY OF ULM   (Germany)

^c UNIVERSITY OF TRIER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33748809799     PISSN: 00255661     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (37)

1. E. Allender and L. Hemachandra. Lower bounds for the low hierarchy. Journal of the ACM, 39(1):234-250, 1992.
2. V. Arvind, Y. Han, L. Hemachandra, J. Köhler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. In Complexity Theory, Current Research, Cambridge University Press, Cambridge, 1993, pp. 1-45.
3. E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. SIAM Journal on Computing, 21(3):529-539, 1992.
4. V. Arvind, J. Köbler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets. Proceedings of the 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 652, Springer-Verlag, Berlin, 1992, pp. 140-151.
5. V. Arvind, J. Köbler, and M. Mundhenk. Lowness and the complexity of sparse and tally descriptions. Proceedings of the Third International Symposium on Algorithm and Computation, Lecture Notes in Computer Science, Vol. 650, Springer-Verlag, Berlin, 1992, pp. 249-258.
6. V. Arvind, J. Köbler, and M. Mundhenk. Hausdorff reductions to sparse sets and to sets of high information content. Proceedings of the 18th Conference on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 711, Springer-Verlag, Berlin, 1993, pp. 232-241.
7. J. Balcázar. Self-reducibility. Journal of Computer and System Sciences, 41:361-388, 1990.
8. J. Balcázar and R. Book. Sets with small generalized Kolmogorov complexity. Acta Informatica, 23(6):679-688, 1986.
9. J. L. Balcázar, R. Book, and U. Schöning. Sparse sets, lowness and highness. SIAM Journal on Computing, 15:739-747, 1986.
10. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, New York, 1988.
11. H. Buhrman, L. Longpré, and E. Spaan. SPARSE reduces conjunctively to TALLY. Proceedings of the 8th Structure in Complexity Theory Conference, IEEE Computer Society Press, New York, May 1993, pp. 208-214.
12. R. Gavaldà and O. Watanabe. On the computational complexity of small descriptions. SIAM Journal on Computing, December 1993, to appear.
13. F. Hausdorff. Grundzüge der Mengenlehre. Leipzig, 1914.
14. L. Hemachandra. The strong exponential hierarchy collapses. Journal of Computer and System Sciences, 39:299-322, 1989.
15. J. Hartmanis and Y. Yesha. Computation times of NP sets of different densities. Theoretical Computer Science, 34:17-32, 1984.
16. NP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282-298, 1989.
17. R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. Proceedings of the 12th ACM Symposium on Theory of Computing, April 1980, pp. 302-309.
18. K. Ko. On self-reducibility and weak p-selectivity. Journal of Computer and System Sciences, 26:209-221, 1983.
19. K. Ko. Distinguishing conjunctive and disjunctive reducibilities by sparse sets. Information and Computation, 81(1):62-87, 1989.
20. J. Köbler. Locating P/poly optimally in the extended low hierarchy. Theoretical Computer Science, 134:263-285, 1994.
21. K. Ko and U. Schöning. On circuit-size complexity and the low hierarchy in NP. SIAM Journal on Computing, 14:41-51, 1985.
22. J. Köbler, U. Schöning, and K. W. Wagner. The difference and truth-table hierarchies of NP. Theoretical Informatics and Applications, 21(4):419-435, 1987.
23. R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103-124, 1975.
24. T. J. Long and M.-J. Sheu. A refinement of the low and high hierarchies. Mathematical Systems Theory, 28(4):299-327, 1995.
25. A. Lozano and J. Torán. Self-reducible sets of small density. Mathematical Systems Theory, 24:83-100, 1991.
26. S. Mahaney. Spase complete sets for NP: solution of a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25(2):130-143, 1982.
27. A. Meyer, M. Paterson. With What Frequency Are Apparently Intractable Problems Difficult? Technical Report MIT/LCS/TM-126, Laboratory for Computer Science, MIT, Cambridge, MA, 1979.
28. M. Mundhenk. On self-reducible sets of low information content. Proceedings of 2nd Italian Conference on Algorithms and Complexity, Lecture Notes in Computer Science, Vol. 778, Springer-Verlag, Berlin, 1994, pp. 203-212.
29. P. Orponen, K. Ko, U. Schöning, and O. Watanabe. Instance complexity. Journal of the ACM, 41:96-121, 1994.
30. M. Ogiwara and A. Lozano. On one query self-reducible sets. Theoretical Computer Science, 112:255-276, 1993.
31. M. Ogiwara and O. Watanabe. On polynomial-time bounded truth-table reducibility of NP sets to sparse sets. SIAM Journal on Computing, 20(3):471-483, 1991.
32. S. Saluja. Relativized limitations of the left set technique and closure classes of sparse sets. Proceedings of the 8th Structure in Complexity Theory Conference, IEEE Computer Society Press, New York, May 1993, pp. 215-222.
33. U. Schöning. A low hierarchy within NP. Journal of Computer and System Sciences, 27:14-28, 1983.
34. U. Schöning. Complexity and Structure, Lecture Notes in Computer Science, Vol. 211, Springer-Verlag, Berlin, 1985.
35. S. Tang and R. Book. Reducibilities on tally and sparse sets. Theoretical Informatics and Applications, 25:293-302, 1991.
36. K. W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53-80, 1987.
37. K. W. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.