Cookies?
Library Header Image
LSE Research Online LSE Library Services

The complexity of approximating the entropy

Batu, Tugkan and Dasgupta, Sanjoy and 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
Subjects: Q Science > QA Mathematics > QA76 Computer software
Sets: Departments > Mathematics
Research centres and groups > Computational, Discrete and Applicable Mathematics@LSE (CDAM)
Date Deposited: 26 Aug 2008 12:38
Last Modified: 01 Oct 2010 09:07
URI: http://eprints.lse.ac.uk/id/eprint/15858

Actions (login required)

View Item View Item