On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems

  • Shin Aida
  • Rainer Schuler
  • Tatsuie Tsukiji
  • Osamu Watanabe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2010)

Abstract

In this paper we separate many-one reducibility from truth- table reducibility for distributional problems in Dist NP under the hy- pothesis that PNP . As a first example we consider the 3-Satisfiability problem (3SAT) with two different distributions on 3CNF formulas. We show that 3SAT using a version of the standard distribution is truth-table reducible but not many-one reducible to 3SAT using a less redundant distribution unless P = NP.

We extend this separation result and define a distributional complexity class C with the following properties: (1) C is a subclass of Dist NP , this relation is proper unless P = NP. (2) C contains Dist P , but it is not contained in Ave P unless Dist NP ≠ Ave ZPP. (3) C has a ≤pm-complete set. (4) C has a ≤ptt-complete set that is not ≤pm-complete unless P = NP. This shows that under the assumption that PNP , the two complete- ness notions differ on some non-trivial subclass of Dist NP.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AT00]
    S. Aida and T. Tsukiji, On the difference among polynomial-time reducibilities for distributional problems (Japanese), in Proc. of the LA Symposium, Winter, RIMS publication, 2000.Google Scholar
  2. [BDG88]
    J. Balcázar, J. Díaz, and J. Gabarró, Structural Complexity I, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1988.Google Scholar
  3. [Betal92]
    S. Ben-David, B. Chor, O. Goldreich, and M. Ludy, On the theory of average case complexity, Journal of Comput. and Syst. Sci., 44:193–219, 1992.MATHCrossRefGoogle Scholar
  4. [Coo71]
    S.A. Cook, The complexity of theorem proving procedures, in the Proc. of the third ACM Sympos. on Theory of Comput., ACM, 151–158, 1971.Google Scholar
  5. [Gur91]
    Y. Gurevich, Average case completeness, Journal of Comput. and Syst. Sci., 42:346–398, 1991.MATHCrossRefMathSciNetGoogle Scholar
  6. [Hom97]
    S. Homer, Structural properties of complete problems for exponential time, in Complexity Theory Retrospective 2 (A.L. Selman Ed.), Springer-Verlag, 135–154, 1997.Google Scholar
  7. [Imp95]
    R. Impagliazzo, A personal view of average-case complexity, in Proc. 10th Conference Structure in Complexity Theory, IEEE, 134–147, 1995.Google Scholar
  8. [KiSe94]
    S. Kirkpatrick and B. Selman, Critical Behauviour in Satisfiablility of Random Boolean Expressions, Science. 264, 1297–1301, 1994.CrossRefMathSciNetGoogle Scholar
  9. [KP92]
    E. Koutsoupias and C. Papadimitriou, On the greedy algorithm for satisfiability, Infom. Process. Lett. 43, 53–55, 1992.MATHCrossRefMathSciNetGoogle Scholar
  10. [LLS75]
    R. Ladner, N. Lynch, and A. Selman, A Comparison of polynomial time reducibilities, Theoretical Computer Science, 1:103–123, 1975.MATHCrossRefMathSciNetGoogle Scholar
  11. [Lev73]
    L.A. Levin, Universal sequential search problem, Problems of Information Transmission, 9:265–266, 1973.Google Scholar
  12. [Lev86]
    L.A. Levin, Average case completeness classes, SIAM J. Comput., 15:285–286, 1986.MATHCrossRefMathSciNetGoogle Scholar
  13. [LY90]
    L. Longpré and P. Young, Cook reducibility is faster than Karp reducibility, J. Comput. Syst. Sci., 41, 389–401, 1990.MATHCrossRefGoogle Scholar
  14. [VV83]
    U. Vazirani and V. Vazirani, A natural encoding scheme proved probabilistic polynomial complete, Theoret. Comput. Sci., 24, 291–300, 1983.MATHCrossRefMathSciNetGoogle Scholar
  15. [Wang97]
    J. Wang, Average-case computational complexity theory, in Complexity Theory Retrospective 2 (A.L. Selman Ed.), Springer-Verlag, 295–328, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Shin Aida
    • 1
  • Rainer Schuler
    • 2
  • Tatsuie Tsukiji
    • 1
  • Osamu Watanabe
    • 2
  1. 1.School of Informatics and SciencesNagoya UniversityNagoya
  2. 2.Dept. of Mathematical and Computing SciencesTokyo Institute of TechnologyTokyo

Personalised recommendations