The incompressibility method

DOI10.1007/3-540-44411-4_3MaRDI QIDQ4471962zbMATH OpenFDO

Authors Tao Jiang, Paul M. B. Vitányi, Ming Li

Publication date 3 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1963/19630036.htm

Mathematics Subject Classification ID

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

Recommendations

• The average‐case area of Heilbronn‐type triangles*
• New applications of the incompressibility method. (Extended abstract)
• Average-case analysis via incompressibility
• Average-case analysis of algorithms using Kolmogorov complexity
• scientific article; zbMATH DE number 1008511

Cited in

(7)

• Average-case analysis of algorithms using Kolmogorov complexity
• Incompressibility and global inversion
• New applications of the incompressibility method. II
• The average‐case area of Heilbronn‐type triangles*
• New applications of the incompressibility method. (Extended abstract)
• Kolmogorov Random Graphs and the Incompressibility Method
• Average-case analysis via incompressibility

This page was built for publication: The incompressibility method

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