• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Book chapter

On Algorithmic Strong Sufficient Statistics

P. 424-433.

The notion of a strong sufficient statistic was introduced in [N.~Vereshchagin, Algorithmic Minimal Sufficient Statistic Revisited. \emph{Proc. 5th Conference on Computability in Europe}, CiE 2009, LNCS 5635, pp. 478-487]. In this paper, we give a survey of nice properties of strong sufficient statistics and show that there are strings for which complexity of every strong sufficient statistic is much larger than complexity of its minimal sufficient statistic.

In book

Berlin: Springer, 2013.