scientific article; zbMATH DE number 6474904

DOI10.4086/TOC.2015.V011A001MaRDI QIDQ2941646zbMATH OpenOpenAlexFDO

Authors

Publication date 21 August 2015

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2015.v011a001

zbMATH Keywords

algorithmscompletenesscomplexity classescomplexity theorysamplable distributions

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Sampling theory in information and communication theory (94A20)

Recommendations

• The complexity of deciding statistical properties of samplable distributions
• Polynomial time samplable distributions
• scientific article; zbMATH DE number 1114051
• On the complexity of computational problems regarding distributions
• The Complexity of Distinguishing Distributions (Invited Talk)
• Elicitation complexity of statistical properties
• On the sample complexity of probabilistic analysis and design methods
• The complexity of distributions
• Distances in probability space and the statistical complexity setup
• Complete problems with L-samplable distributions

Cites work

• More uses of exchangeability: representations of complex random structures
• The complexity of deciding statistical properties of samplable distributions
• Uses of exchangeability

Cited in

(2)

• The complexity of deciding statistical properties of samplable distributions
• Communication complexity of statistical distance

This page was built for publication:

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