{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,15]],"date-time":"2023-09-15T01:47:09Z","timestamp":1694742429911},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,11,26]],"date-time":"2013-11-26T00:00:00Z","timestamp":1385424000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s00224-013-9517-5","type":"journal-article","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T00:42:52Z","timestamp":1385340172000},"page":"305-317","source":"Crossref","is-referenced-by-count":1,"title":["Encoding Invariance in Average Case Complexity"],"prefix":"10.1007","volume":"54","author":[{"given":"Nikolay","family":"Vereshchagin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,26]]},"reference":[{"issue":"2","key":"9517_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0400000004","volume":"1","author":"A. Bogdanov","year":"2006","unstructured":"Bogdanov, A., Trevisan, L.: Average-case complexity. Found. Trends Theor. Comput. Sci. 1(2), 1\u2013106 (2006)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"2","key":"9517_CR2","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0022-0000(92)90019-F","volume":"44","author":"S. Ben-David","year":"1992","unstructured":"Ben-David, S., Chor, B., Goldreich, O., Luby, M.: On the theory of average case complexity. J. Comput. Syst. Sci. 44(2), 193\u2013219 (1992)","journal-title":"J. Comput. Syst. Sci."},{"key":"9517_CR3","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28, 12\u201324 (1999)","journal-title":"SIAM J. Comput."},{"key":"9517_CR4","first-page":"812","volume-title":"FOCS","author":"R. Impagliazzo","year":"1990","unstructured":"Impagliazzo, R., Levin, L.A.: No better ways to generate hard NP instances than picking uniformly at random. In: FOCS, pp. 812\u2013821 (1990)"},{"issue":"1","key":"9517_CR5","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1137\/0215020","volume":"15","author":"L.A. Levin","year":"1986","unstructured":"Levin, L.A.: Average case complete problems. SIAM J. Comput. 15(1), 285\u2013286 (1986)","journal-title":"SIAM J. Comput."}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9517-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9517-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9517-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:54:26Z","timestamp":1558698866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9517-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,26]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9517"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9517-5","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,26]]}}}