Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR10-090 | 14th May 2010 13:59

{Algorithmic Minimal Sufficient Statistics: a New Definition

RSS-Feed




TR10-090
Authors: Nikolay Vereshchagin
Publication: 27th May 2010 13:06
Downloads: 1430
Keywords: 


Abstract:

We express some criticism about the definition of an algorithmic sufficient statistic and, in particular, of an algorithmic minimal sufficient statistic. We propose another definition, which has better properties.



ISSN 1433-8092 | Imprint