Comparing notions of computational entropy

DOI10.1007/S00224-009-9177-7MaRDI QIDQ733747zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Comparing Notions of Computational Entropy
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Some notions of entropy for cryptography. (Invited talk)
• The many entropies in one-way functions

Cites work

• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• A Mathematical Theory of Communication
• A Pseudorandom Generator from any One-way Function
• Compression and Ranking
• Compression of samplable sources
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• Hardness vs randomness
• Kolmogorov complexity and information theory. With an interpretation in terms of questions and answers
• On the Lambert \(w\) function

Cited in

(6)

• Gambling, computational information and encryption security
• Comparing Notions of Computational Entropy
• Computational analogues of entropy
• Conditional Computational Entropy, or Toward Separating Pseudoentropy from Compressibility
• One-way functions using algorithmic and classical information theories
• Entropy conservation for comparison-based algorithms

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

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