Advertisement

Lowness and the complexity of sparse and tally descriptions

  • V. Arvind
  • J. Köbler
  • M. Mundhenk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 650)

Abstract

We investigate the complexity of obtaining sparse descriptions for sets in various reduction classes to sparse sets. Let A be a set in a certain reduction class R r (SPARSE). Then we are interested in finding upper bounds for the complexity (relative to A) of sparse sets S such that A ∃ R r (S). By establishing such upper bounds we are able to derive the lowness of A. In particular, we show that if a set A is in the class R hd p (R c p (SPARSE)) then A is in R p c (R hd p (S)) for a sparse set S ∃ NP(A). As a consequence we can locate R hd p (R c p (SPARSE)) in the EL 3 Θ level of the extended low hierarchy. Since R hd p (R c p (SPARSE)) \(\supseteq\)R b p (R c p (SPARSE)) this solves the open problem of locating the closure of sparse sets under bounded truth-table reductions optimally in the extended low hierarchy. Furthermore, we show that for every AR d p (SPARSE) there exists a sparse set S ∃ NP(A ⊕ SAT)/Fθ 2 p (A) such that AR d p (S). Based on this we show that R 1−tt p (R d p (SPARSE)) is in EL 3 Θ .

Finally, we construct for every set AR c p (TALLY)∩R d p (TALLY) (or equivalently, A ∃ IC[log, poly], as shown in [AHH+92]) a tally set T ∃ P(A ⊕ SAT) such that AR c p (T) ∩ R d p (T). This implies that the class IC[log, poly] of sets with low instance complexity is contained in EL 1 Σ .

Keywords

Polynomial Time Simplicity Result Reduction Class Polynomial Time Hierarchy SlAM Journal 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AH92]
    E. Allender and L. Hemachandra. Lower bounds for the low hierarchy. Journal of the ACM, 39(1):234–250, 1992.CrossRefGoogle Scholar
  2. [AHH+92]
    V. Arvind, Y. Han, L. Hemachandra, J. Köbler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schöning, R. Silvestri, and T. Thierauf. Reductions to sets of low information content. Proceedings of the 19th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, #623:162–173, Springer Verlag, 1992.Google Scholar
  3. [AHOW]
    E. Allender, L. Hemachandra, M. Ogiwara, and O. Watanabe. Relating equivalence and reducibility to sparse sets. SIAM Journal on Computing, to appear.Google Scholar
  4. [AKM92]
    V. Arvind, J. Köbler, and M. Mundhenk. On bounded truth-table, conjunctive, and randomized reductions to sparse sets. To appear in Proceedings 12th Conference on the Foundations of Software Technology & Theoretical Computer Science, 1992.Google Scholar
  5. [BBS6]
    J. Balcázar and R. Book. Sets with small generalized Kolmogorov complexity. Acta Informatica, 23(6):679–688, 1986.CrossRefGoogle Scholar
  6. [BBS86]
    J.L. Balcázar, R. Book, and U. Schöning. Sparse sets, lowness and highness. SIAM Journal on Computing, 23:679–688, 1986.Google Scholar
  7. [BDG]
    J.L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1988.Google Scholar
  8. [BLS92]
    H. Buhrman, L. Longpré, and E. Spaan. Sparse reduces conjunctively to tally. Technical Report NU-CCS-92-8, Northeastern University, Boston, 1992.Google Scholar
  9. [GW91]
    R. Gavaldà and O. Watanabe. On the computational complexity of small descriptions. Proceedings of the 6th Structure in Complexity Theory Conference, 89–101, IEEE Computer Society Press, 1991.Google Scholar
  10. [Hau14]
    F. Hausdorff. Grundzüge der Mengenlehre. Leipzig, 1914.Google Scholar
  11. [HY84]
    J. Hartmanis and Y. Yesha. Computation times of NP sets of different densities. Theoretical Computer Science, 34:17–32, 1984.CrossRefGoogle Scholar
  12. [Hem87]
    L. Hemachandra. The strong exponential hierarchy collapses. Proceedings of the 19th ACM Symposium on Theory of Computing, 110–122, 1987.Google Scholar
  13. [Kad87]
    J. Kadin. PNP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282–298, 1989.Google Scholar
  14. [KL80]
    R. Karp and R. Lipton. Some connections between nonuniform and uniform complexity classes. Proceedings of the 12th ACM Symposium on Theory of Computing, 302–309, April 1980.Google Scholar
  15. [KoSc85]
    K. Ko and U. Schöning. On circuit-size complexity and the low hierarchy in NP. SIAM Journal on Computing, 14:41–51, 1985.Google Scholar
  16. [Köb92]
    J. Köbler. Locating P/poly optimally in the low hierarchy. Ulmer Informatik-Bericht 92-05, UniversitÄt Ulm, August 1992.Google Scholar
  17. [KSW87]
    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.Google Scholar
  18. [KT90]
    J. Köbler and T. Thierauf. Complexity classes with advice. Proceedings 5th Structure in Complexity Theory Conference, 305–315, IEEE Computer Society, 1990.Google Scholar
  19. [LLS75]
    R. Ladner, N. Lynch, and A. Selman. A comparison of polynomial time reducibilities. Theoretical Computer Science, 1(2):103–124, 1975.CrossRefGoogle Scholar
  20. [LS91]
    T.J. Long and M.-J. Sheu. A refinement of the low and high hierarchies. Technical Report OSU-CISRC-2/91-TR6, The Ohio State University, 1991.Google Scholar
  21. [LT91]
    A. Lozano and J. Torán. Self-reducible sets of small density. Mathematical Systems Theory, 24:83–100, 1991.Google Scholar
  22. [Mah82]
    S. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis. Journal of Computer and System Sciences, 25(2):130–143, 1982.CrossRefGoogle Scholar
  23. [MP79]
    A. Meyer, M. Paterson. With what frequency are apparently intractable problems difficult? Tech. Report MIT/LCS/TM-126, Lab. for Computer Science, MIT, Cambridge, 1979.Google Scholar
  24. [OKSW]
    P. Orponen, K. Ko, U. Schöning, and O. Watanabe. Instance complexity. Journal of the ACM, to appear.Google Scholar
  25. [OW91]
    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.CrossRefGoogle Scholar
  26. [Sch83]
    U. Schöning. A low hierarchy within NP. Journal of Computer and System Sciences, 27:14–28, 1983.CrossRefGoogle Scholar
  27. [Sch86]
    U. Schöning. Complexity and Structure, Lecture Notes in Computer Science, #211, Springer-Verlag, 1985Google Scholar
  28. [SL92]
    M.-J. Sheu and T.J. Long. The extended low hierarchy is an infinite hierarchy. Proceedings of 9th Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, #577:187–189, Springer-Verlag 1992.Google Scholar
  29. [TB91]
    S. Tang and R. Book. Reducibilities on tally and sparse sets. Theoretical Informatics and Applications, 25:293–302, 1991.Google Scholar
  30. [Wag87]
    K.W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53–80, 1987.CrossRefGoogle Scholar
  31. [Wag90]
    K.W. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833–846, 1990.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • V. Arvind
    • 1
  • J. Köbler
    • 2
  • M. Mundhenk
    • 2
  1. 1.Department of Computer Science and EngineeringIndian Institute of Technology, DelhiNew DelhiIndia
  2. 2.Abteilung für Theoretische InformatikUniversitÄt UlmUlmGermany

Personalised recommendations