scientific article; zbMATH DE number 7204268

DOI10.4230/LIPICS.CCC.2017.17MaRDI QIDQ5111147zbMATH OpenFDO

Authors Alexey Milovanov, Nikolai K. Vereshchagin

Publication date 26 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.CCC.2017.17

zbMATH Keywords

algorithmic statisticsdistinguishing complexityelusive setKolmogorov complexity

Mathematics Subject Classification ID

Foundations and philosophical topics in statistics (62A01) Statistical aspects of information-theoretic topics (62B10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Algorithmic statistics and prediction for polynomial time-bounded algorithms
• scientific article; zbMATH DE number 3971958
• scientific article; zbMATH DE number 3870594
• scientific article; zbMATH DE number 4068049
• Stochastic algorithms for computing means of probability measures
• scientific article; zbMATH DE number 1946759
• Une version presque sûre du théorème de la limite centrale pour les algorithmes stochastiques
• A linear-time algorithm for computing the multinomial stochastic complexity
• Probabilistic parameterized polynomial time

Cited in

(3)

• Algorithmic statistics and prediction for polynomial time-bounded algorithms
• A linear-time algorithm for computing the multinomial stochastic complexity
• Computing population variance and entropy under interval uncertainty: Linear-time algorithms

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 Q5111147)