Comparing notions of computational entropy

DOI10.1007/S00224-009-9177-7zbMATH Open1185.68371OpenAlexW2019140010MaRDI QIDQ733747FDOQ733747

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

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

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)

Cites Work

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

Cited In (3)

• Gambling, Computational Information and Encryption Security
• 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)