{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T10:40:19Z","timestamp":1693564819284},"reference-count":10,"publisher":"Wiley","issue":"14-18","license":[{"start":{"date-parts":[[2006,11,13]],"date-time":"2006-11-13T00:00:00Z","timestamp":1163376000000},"content-version":"vor","delay-in-days":7986,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Logic Qtrly"],"published-print":{"date-parts":[[1985,1]]},"DOI":"10.1002\/malq.19850311411","type":"journal-article","created":{"date-parts":[[2007,5,28]],"date-time":"2007-05-28T23:25:47Z","timestamp":1180394747000},"page":"281-287","source":"Crossref","is-referenced-by-count":0,"title":["On Sparse Complete Sets"],"prefix":"10.1002","volume":"31","author":[{"given":"Gerd","family":"Wechsung","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,11,13]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"crossref","unstructured":"Adleman L. M. andK.Manders Reducibility randomness and intractibility. In: Conference Report of the Ninth Annual ACM Symposium on Theory of Computing1977 pp.151\u2013163.","DOI":"10.1145\/800105.803405"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08860-1_6"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0208034"},{"key":"e_1_2_1_5_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022494"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(81)90007-4"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90002-2"},{"key":"e_1_2_1_9_2","unstructured":"Meyer A. R. andM. S.Paterson With what frequency are apparently intractable problems difficult?MIT Techn. Report Feb.1979."},{"key":"e_1_2_1_10_2","volume-title":"Computational Complexity","author":"Wagner K.","year":"1985"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90020-8"}],"container-title":["Mathematical Logic Quarterly"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fmalq.19850311411","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/malq.19850311411","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T04:25:33Z","timestamp":1693455933000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/malq.19850311411"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":10,"journal-issue":{"issue":"14-18","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["10.1002\/malq.19850311411"],"URL":"https:\/\/doi.org\/10.1002\/malq.19850311411","archive":["Portico"],"relation":{},"ISSN":["0942-5616","1521-3870"],"issn-type":[{"value":"0942-5616","type":"print"},{"value":"1521-3870","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}