Optimal representation in average using Kolmogorov complexity

DOI10.1016/S0304-3975(97)00275-2zbMATH Open0915.68093OpenAlexW2039147967MaRDI QIDQ1276258FDOQ1276258

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A Mathematical Theory of Communication
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Method for the Construction of Minimum-Redundancy Codes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)