Polynomial Time Samplable Distributions

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...

Full description

Saved in:
Bibliographic Details
Published inJournal of Complexity Vol. 15; no. 4; pp. 557 - 574
Main Author Yamakami, Tomoyuki
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.12.1999
Subjects
average-case complexity
domination condition
sampling algorithm
strong one-way functions
average-case complexity
sampling algorithm
domination condition
strong one-way functions
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0885-064X
1090-2708
DOI:10.1006/jcom.1999.0523