Cookies?
Library Header Image
LSE Research Online LSE Library Services

The complexity of approximating the entropy

Batu, Tugkan, 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.

Item Type: Article
Official URL: http://epubs.siam.org/sam-bin/dbq/toclist/SICOMP
Additional Information: © 2005 SIAM
Library of Congress subject classification: Q Science > QA Mathematics > QA76 Computer software
Sets: Departments > Mathematics
Research centres and groups > Computational, Discrete and Applicable Mathematics@LSE (CDAM)
Rights: http://www.lse.ac.uk/library/usingTheLibrary/academicSupport/OA/depositYourResearch.aspx
Date Deposited: 26 Aug 2008 12:38
URL: http://eprints.lse.ac.uk/15858/

Actions (login required)

Record administration - authorised staff only Record administration - authorised staff only