Advertisement

Sets computable in polynomial time on average

  • Rainer Schuler
  • Tomoyuki Yamakami
Session 7B: Complexity Theory
Part of the Lecture Notes in Computer Science book series (LNCS, volume 959)

Abstract

In this paper, we discuss the complexity and properties of the sets which are computable in polynomial-time on average. This study is motivated by Levin's question of whether all sets in NP are solvable in polynomial-time on average for every reasonable (i.e., polynomial-time computable) distribution on the instances. Let PP-comp denote the class of all those sets which are computable in polynomial-time on average for every polynomial-time computable distribution on the instances. It is known that P ⊂ PP-comp ⊂ E. In this paper, we show that PP-comp is not contained in DTIME(2cn) for any constant c and that it lacks some basic structural properties: for example, it is not closed under many-one reducibility or for the existential operator. From these results, it follows that PP-comp contains P-immune sets but no P-bi-immune sets; it is not included in P/cn for any constant c; and it is different from most of the well-known complexity classes, such as UP, NP, BPP, and PP. Finally, we show that, relative to a random oracle, NP is not included in PP-comp and PP-comp is not in PSPACE with probability 1.

Keywords

Turing Machine Complexity Core Random Oracle Average Computation Time Existential Operator 
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. 1.
    J.L. Balcázar, J. Díaz, and J. Gabarró, Structural complexity I+II, Springer, Berlin, 1989(I), 1990(II).Google Scholar
  2. 2.
    J.L. Balcázar and U. Schöning, Bi-immune sets for complexity classes, Math. Systems Theory, 18 (1985), pp.1–10.CrossRefGoogle Scholar
  3. 3.
    J. Belanger and J. Wang, Isomorphisms of NP complete problems on random instances, in Proc., 8th Conf. on Structure in Complexity Theory, 1993, pp.65–74.Google Scholar
  4. 4.
    S. Ben-David, B. Chor, O. Goldreich, and M. Luby, On the theory of average case complexity, J. Comput. System Sci., 44 (1992), pp.193–219.CrossRefGoogle Scholar
  5. 5.
    C.H. Bennett and J. Gill, Relative to a random oracle A, PA ≠ NPA ≠ co-NPA with probability 1, SIAM J. Comput., 10 (1981), pp.96–113.CrossRefGoogle Scholar
  6. 6.
    J. Goldsmith, L.A. Hemachandra, D. Joseph, and P. Young, Near-testable sets, SIAM. J. Comput., 20 (1991), pp.506–523.CrossRefGoogle Scholar
  7. 7.
    Y. Gurevich, Average case complexity, J. Comput. System Sci., 42 (1991), pp.346–398.CrossRefGoogle Scholar
  8. 8.
    R. Impagliazzo and L. Levin, No better ways to generate hard NP instances than picking uniformly at random, in Proc., 31st FOCS, 1990, pp.812–821.Google Scholar
  9. 9.
    K.I. Ko and H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci., 20 (1982), pp.323–352.Google Scholar
  10. 10.
    K.I. Ko and D. Moore, Completeness, approximation and density, SIAM J. Comput., 10 (1981), pp.787–796.CrossRefGoogle Scholar
  11. 11.
    L. Levin, Average case complete problems, SIAM J. Comput., 15 (1986), pp.285–286. A preliminary version appeared in Proc., 16th STOC, 1984, p.465.CrossRefGoogle Scholar
  12. 12.
    E. Mayordomo, Almost every set in exponential time is P-bi-immune, in Proc., 17th MFCS, LNCS, Vol.629, 1992, pp.392–400.Google Scholar
  13. 13.
    A.R. Meyer and M. Paterson, With what frequency are apparently intractable problems difficult, Technical Report TM-126, MIT, 1979.Google Scholar
  14. 14.
    P. Orponen and U. Schöning, On the density and complexity of polynomial cores for intractable sets, Inform. Control, 70 (1986), pp.54–68.CrossRefGoogle Scholar
  15. 15.
    R. Schuler, On average polynomial time, Technical Report, Universität Ulm, 1994.Google Scholar
  16. 16.
    R. Schuler and T. Yamakami, Structural average case complexity, in Proc., 12th FST & TCS, LNCS, Vol.652, 1992, pp 128–139.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Rainer Schuler
    • 1
  • Tomoyuki Yamakami
    • 2
  1. 1.Abteilung Theoretische InformatikUniversität UlmUlmGermany
  2. 2.Department of Computer ScienceUniversity of TorontoTorontoCanada

Personalised recommendations