Elsevier

Journal of Complexity

Volume 15, Issue 4, December 1999, Pages 557-574
Journal of Complexity

Regular Article
Polynomial Time Samplable Distributions

https://doi.org/10.1006/jcom.1999.0523Get rights and content
Under an Elsevier user license
open archive

Abstract

This paper studies the complexity of the polynomial-time samplable (P-samplable) distributions, which can be approximated within an exponentially small factor by sampling algorithms in time polynomial in the length of their outputs. The paper shows that common assumptions in complexity theory yield the separation of polynomial-time samplable distributions from the polynomial-time computable distributions with respect to polynomial domination, average-polynomial domination, polynomial equivalence, and average-polynomial equivalence.

Keywords

average-case complexity
sampling algorithm
domination condition
strong one-way functions

Cited by (0)

A preliminary version of the paper appeared in the Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1113, pp. 566–578, 1996.

f1

E-mail: [email protected]

2

Current affiliation: Department of Computer Science, Princeton University, Princeton, NJ 08544.