Comparing notions of computational entropy

DOI10.1007/s00224-009-9177-7zbMath1185.68371OpenAlexW2019140010MaRDI QIDQ733747

D. Kharzeev

Publication date: 19 October 2009

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-009-9177-7

zbMATH Keywords

Kolmogorov complexitycompressibilitycomputational entropy

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (2)

Gambling, Computational Information and Encryption Security ⋮ One-way functions using algorithmic and classical information theories

Cites Work

• Unnamed Item
• A Mathematical Theory of Communication
• Compression of samplable sources
• Hardness vs randomness
• Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers
• On the Lambert \(w\) function
• Compression and Ranking
• A Pseudorandom Generator from any One-way Function
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques

This page was built for publication: Comparing notions of computational entropy