On Algorithmic Strong Sufficient Statistics

DOI10.1007/978-3-642-39053-1_50zbMath1362.68117OpenAlexW168395253MaRDI QIDQ5326389

Nikolai K. Vereshchagin

Publication date: 5 August 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39053-1_50

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Sufficient statistics and fields (62B05)

Related Items (3)

Algorithmic minimal sufficient statistics: a new approach ⋮ Some properties of antistochastic strings ⋮ An extended coding theorem with application to quantum complexities

This page was built for publication: On Algorithmic Strong Sufficient Statistics