The complexity of approximating entropy

DOI10.1145/509907.510005zbMATH Open1192.94074OpenAlexW2291181759MaRDI QIDQ3579192FDOQ3579192

Authors: Tuğkan Batu, Sanjoy Dasgupta, Ravi Kumar, Ronitt Rubinfeld 

Publication date: 5 August 2010

Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/509907.510005

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Measures of information, entropy (94A17)

Cited In (5)

• Testing monotone continuous distributions on high-dimensional real cubes
• Title not available (Why is that?)
• Automation of quantitative information-flow analysis
• On the complexity of computational problems regarding distributions
• The power and limitations of uniform samples in testing properties of figures

This page was built for publication: The complexity of approximating entropy

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