Title of article :
Kolmogorov complexity of enumerating finite sets
Author/Authors :
Nikolai K. Vereshchagin، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 2007
Pages :
6
From page :
34
To page :
39
Keywords :
Kolmogorov complexity , The a priori probability , randomized algorithms
Journal title :
Information Processing Letters
Serial Year :
2007
Journal title :
Information Processing Letters
Record number :
130445
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=130445
بازگشت