Optimal representation in average using Kolmogorov complexity

DOI10.1016/S0304-3975(97)00275-2MaRDI QIDQ1276258zbMATH OpenOpenAlexFDO

Authors Jean-Paul Delahaye, Eric Rivals

Publication date 20 January 1999

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00275-2

zbMATH Keywords

algorithmic complexity theory\(K\)-optimality on average

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Average-case analysis via incompressibility
• Average-case analysis of algorithms using Kolmogorov complexity
• scientific article; zbMATH DE number 1008511
• scientific article; zbMATH DE number 726918
• scientific article; zbMATH DE number 107774

Cites work

• scientific article; zbMATH DE number 107482 (Why is no real title available?)
• scientific article; zbMATH DE number 107775 (Why is no real title available?)
• scientific article; zbMATH DE number 108347 (Why is no real title available?)
• scientific article; zbMATH DE number 736618 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 801745 (Why is no real title available?)
• A Mathematical Theory of Communication
• A Method for the Construction of Minimum-Redundancy Codes
• Compression and Ranking

This page was built for publication: Optimal representation in average using Kolmogorov complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1276258)