Advertisement

Polynomial time samplable distributions

  • Tomoyuki Yamakami
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1113)

Abstract

This paper studies distributions which can be sampled by randomized algorithms in time polynomial in the length of their outputs. Those distributions are called “polynomial-time samplable” and important to average-case complexity theory, cryptography, and statistical physics. This paper shows that those distributions are exactly as hard as #P-functions to compute deterministically and at least as hard as NP-sets to approximate by deterministic protocols.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. Belanger and J. Wang, Isomorphisms of NP complete problems on random instances, in: Proceedings, 8th Conference on Structure in Complexity Theory, 1993, pp.65–74.Google Scholar
  2. 2.
    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
  3. 3.
    J. Carter and M. Wegman, Universal classes of hash functions, J. Comput. System Sci., 18 (1979), pp.143–154.CrossRefGoogle Scholar
  4. 4.
    Y. Gurevich, Average case complexity, J. Comput. System Sci., 42 (1991), pp.346–398.CrossRefGoogle Scholar
  5. 5.
    R. Impagliazzo and L. A. Levin, No better ways to generate hard NP instances than picking uniformly at random, in: Proceedings, 31st IEEE Conference on Foundation of Computer Science, pp. 812–821, 1990.Google Scholar
  6. 6.
    J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, Construction of a pseudo-random generator from any one-way function, Technical Report, TR-91-068, International Computer Science Institute, Berkeley, California, 1991.Google Scholar
  7. 7.
    K. Ko and H. Friedman, Computational complexity of real functions, Theoretical Computer Science, 20 (1982), pp.323–352.Google Scholar
  8. 8.
    L. Levin, Average case complete problems, SIAM J. Comput. 15 (1986), pp.285–286.CrossRefGoogle Scholar
  9. 9.
    M. Li and P. M.B. Vitányi, Average case complexity under the universal distribution equals worst-case complexity, Information Processing Letters, 42 (1992), pp.145–149.CrossRefGoogle Scholar
  10. 10.
    M. Li and P. Vitányi, An introduction to Kolmogorov complexity and its applications, Springer-Verlag, New York, 1993.Google Scholar
  11. 11.
    J. Machta and R. Greenlaw, The computational complexity of generating random fractals, Technical Report, TR 93-04, University of Massachusetts at Amherst, 1993.Google Scholar
  12. 12.
    U. Schöning, Complexity and Structure, LNCS, Vol.211, 1986.Google Scholar
  13. 13.
    R. Schuler, Some properties of sets tractable under every polynomial-time computable distribution, Information Processing Letters, 55 (1995), pp.179–184.CrossRefGoogle Scholar
  14. 14.
    R. Schuler and O. Watanabe, Towards average-case complexity analysis of NP optimization problems, in: Proceedings, 10th on Structure in Complexity Theory Conference, pp.148–159, 1995.Google Scholar
  15. 15.
    R. Schuler and T. Yamakami, Structural average case complexity, to appear in Journal of Computer and System Sciences. A preliminary version appeared in: Proceedings, 12th Foundations of Software Technology and Theoretical Computer Science, LNCS, Vol.652, 1992, pp.128–139.Google Scholar
  16. 16.
    R. Schuler and T. Yamakami, Sets computable in polynomial time on average, in: Proceedings, 1st Annual International Computing and Combinatorics Conference, LNCS, Vol.959, pp.400–409, 1995.Google Scholar
  17. 17.
    L. Valiant, The complexity of computing the permanent, Theoretical Computer Science, 5 (1979), pp.189–201.CrossRefGoogle Scholar
  18. 18.
    J. Wang and J. Belanger, On average P vs. average NP, in Complexity Theory — Current Research, editors K. Ambos-Spies, S. Homer and U. Schöning, Cambridge University Press, pp.47–67, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Tomoyuki Yamakami
    • 1
  1. 1.Department of Computer ScienceUniversity of TorontoTorontoCanada

Personalised recommendations