{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:44Z","timestamp":1725664064829},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_77","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:58:04Z","timestamp":1330253884000},"page":"239-248","source":"Crossref","is-referenced-by-count":0,"title":["On malign input distributions for algorithms"],"prefix":"10.1007","author":[{"given":"Kojiro","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/321386.321395","volume":"14","author":"M. Blum","year":"1967","unstructured":"M. Blum: A machine-independent theory of the complexity of recursive functions. J. ACM 14, 322\u2013336 (1967)","journal-title":"J. ACM"},{"key":"26_CR2","unstructured":"M. Li, P.M.B. Vit\u00e1nyi: A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution. In: Proc. of the 30th FOCS, 1989, pp.34\u201339"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"M. Li, P.M.B. Vit\u00e1nyi: Kolmogorov complexity and its applications. In: J. van Leeuwen (ed.): Handbook of Theoretical Computer Science, Vol. A, Chap. IV. Elsevier and MIT Press 1990, pp.187\u2013254","DOI":"10.1016\/B978-0-444-88071-0.50009-6"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"P.B. Miltersen: The complexity of malign ensembles. In: Proc. of the 6th SICT, 1991, pp.164\u2013171","DOI":"10.1109\/SCT.1991.160257"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:03:00Z","timestamp":1605646980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}