The complexity of approximating the entropy

Batu, T.ORCID logo, Dasgupta, S., Kumar, R. & Rubinfeld, R. (2005). The complexity of approximating the entropy. SIAM Journal on Computing, 35(1), 132-150. https://doi.org/10.1137/S0097539702403645
Copy
Item Type Article
Copyright holders © 2005 SIAM
Departments LSE > Academic Departments > Mathematics
DOI 10.1137/S0097539702403645
Date Deposited 26 Aug 2008
URI https://researchonline.lse.ac.uk/id/eprint/15858

Explore Further

Full text not available from this repository.

Export as

EndNote BibTeX Reference Manager Refer Atom Dublin Core JSON Multiline CSV
Export

Downloads
View more statistics