{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T22:10:28Z","timestamp":1737324628595,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540730002"},{"type":"electronic","value":"9783540730019"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-73001-9_63","type":"book-chapter","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:16:31Z","timestamp":1185290191000},"page":"606-620","source":"Crossref","is-referenced-by-count":0,"title":["Comparing Notions of Computational Entropy"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Pinto","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/978-3-540-45198-3_18","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"B. Barak","year":"2003","unstructured":"Barak, B., Shaltiel, R., Widgerson, A.: Computational Analogues of Entropy. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 200\u2013215. Springer, Heidelberg (2003), Available at http:\/\/www.math.ias.edu\/~avi\/PUBLICATIONS\/MYPAPERS\/BSW03\/bsw03.ps"},{"issue":"4","key":"63_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/321356.321363","volume":"13","author":"G.J. Chaitin","year":"1966","unstructured":"Chaitin, G.J.: On the length of programs for computing finite binary sequences. Journal of the ACM\u00a013(4), 145\u2013149 (1966)","journal-title":"Journal of the ACM"},{"issue":"3","key":"63_CR3","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1137\/0220034","volume":"20","author":"A. Goldberg","year":"1991","unstructured":"Goldberg, A., Sipser, M.: Compression and Ranking. SIAM Journal On Computing\u00a020(3), 524\u2013536 (1991)","journal-title":"SIAM Journal On Computing"},{"issue":"4","key":"63_CR4","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1023\/A:1025011119492","volume":"12","author":"P. Gr\u00fcnwald","year":"2003","unstructured":"Gr\u00fcnwald, P., Vit\u00e1nyi, P.: Kolmogorov Complexity and Information Theory. Journal of Logic, Language and Information\u00a012(4), 497\u2013529 (2003), Available at http:\/\/citeseer.ist.psu.edu\/565384.html","journal-title":"Journal of Logic, Language and Information"},{"issue":"4","key":"63_CR5","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1999","unstructured":"Hastad, J., Impagliazzo, R., Levin, L., Luby, M.: A Pseudorandom Generator from any One-way Function. SIAM Journal On Computing\u00a028(4), 1364\u20131396 (1999), Available at http:\/\/citeseer.ist.psu.edu\/hastad99pseudorandom.html","journal-title":"SIAM Journal On Computing"},{"issue":"1","key":"63_CR6","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Problems Inform. Transmission\u00a01(1), 1\u20137 (1965)","journal-title":"Problems Inform. Transmission"},{"key":"63_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to Kolmogorov complexity and its applications, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"key":"63_CR8","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Technical Journal, vol. 27, pp. 379\u2013423 and 623\u2013656, July and October (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"63_CR9","doi-asserted-by":"crossref","unstructured":"Wee, H.: On Pseudoentropy versus Compressibility. IEEE Conference On Computational Complexity, pp. 29\u201341, (2004) Available at http:\/\/ieeexplore.ieee.org\/iel5\/9188\/29139\/01313782.pdf","DOI":"10.1109\/CCC.2004.1313782"},{"key":"63_CR10","first-page":"1","volume-title":"Complexity in Information Theory","author":"A. Yao","year":"1988","unstructured":"Yao, A.: Computational Information Theory. In: Complexity in Information Theory, pp. 1\u201315. Springer, Heidelberg (1988)"}],"container-title":["Lecture Notes in Computer Science","Computation and Logic in the Real World"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73001-9_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T21:53:28Z","timestamp":1737323608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73001-9_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540730002","9783540730019"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73001-9_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}