×

zbMATH — the first resource for mathematics

The complexity of approximating entropy. (English) Zbl 1192.94074
Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 678-687, electronic only (2002).
For the entire collection see [Zbl 1074.68502].

MSC:
94A17 Measures of information, entropy
68Q25 Analysis of algorithms and problem complexity
PDF BibTeX XML Cite
Full Text: DOI