Time hierarchies for sampling distributions

DOI10.1137/120898553MaRDI QIDQ5173253zbMATH OpenOpenAlexFDO

Authors

Publication date 9 February 2015

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/120898553

zbMATH Keywords

distributionslist-decodable codessamplingtime hierarchies

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Decoding (94B35)

Recommendations

• Time hierarchies for sampling distributions
• scientific article; zbMATH DE number 1114051
• Heuristic time hierarchies via hierarchies for sampling distributions
• Polynomial time samplable distributions
• Sampling algorithms: lower bounds and applications

Cited in

(11)

• On average time hierarchies
• Polynomial time samplable distributions
• Communication complexity with small advantage
• Sampling hierarchies of discrete random structures
• Sampling at a random time with a heavy-tailed distribution
• Time hierarchies for sampling distributions
• Heuristic time hierarchies via hierarchies for sampling distributions
• scientific article; zbMATH DE number 1114051 (Why is no real title available?)
• scientific article; zbMATH DE number 7650118 (Why is no real title available?)
• Sampling, flowers and communication
• An efficient coding theorem via probabilistic representations and its applications

This page was built for publication: Time hierarchies for sampling distributions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173253)