{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T13:27:36Z","timestamp":1764250056394,"version":"build-2065373602"},"reference-count":0,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2002.1004329","type":"proceedings-article","created":{"date-parts":[[2003,6,25]],"date-time":"2003-06-25T20:30:39Z","timestamp":1056573039000},"page":"17","source":"Crossref","is-referenced-by-count":5,"title":["The complexity of approximating the entropy"],"prefix":"10.1109","author":[{"given":"T.","family":"Batu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Dasgupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Rubinfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","event":{"name":"17th IEEE Annual Conference on Computational Complexity","acronym":"CCC-02","location":"Montreal, Que., Canada"},"container-title":["Proceedings 17th IEEE Annual Conference on Computational Complexity"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/7872\/21680\/01004329.pdf?arnumber=1004329","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T23:37:39Z","timestamp":1489189059000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1004329\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.1109\/ccc.2002.1004329","relation":{},"subject":[]}}