Cookies?
Library Header Image
LSE Research Online LSE Library Services

The complexity of approximating the entropy

Batu, Tugkan ORCID: 0000-0003-3914-4645, Dasgupta, Sanjoy, Kumar, Ravi and Rubinfeld, Ronitt (2005) The complexity of approximating the entropy. SIAM Journal on Computing, 35 (1). pp. 132-150. ISSN 0097-5397

Full text not available from this repository.
Identification Number: 10.1137/S0097539702403645
Item Type: Article
Official URL: http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP
Additional Information: © 2005 SIAM
Divisions: Mathematics
Subjects: Q Science > QA Mathematics > QA76 Computer software
Date Deposited: 26 Aug 2008 12:38
Last Modified: 20 Sep 2021 01:41
URI: http://eprints.lse.ac.uk/id/eprint/15858

Actions (login required)

View Item View Item