scientific article

DOI10.4086/toc.2015.v011a001zbMath1336.68108OpenAlexW2280059905MaRDI QIDQ2941646

No author found.

Publication date: 21 August 2015

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

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmscompletenesscomplexity theorycomplexity classessamplable distributions

Mathematics Subject Classification ID

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

Related Items (1)

Communication Complexity of Statistical Distance

Cites Work

• Uses of exchangeability
• The Complexity of Deciding Statistical Properties of Samplable Distributions.
• More Uses of Exchangeability: Representations of Complex Random Structures

This page was built for publication: