{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:24Z","timestamp":1750308984763,"version":"3.41.0"},"reference-count":2,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGACT News"],"published-print":{"date-parts":[[1982,1]]},"DOI":"10.1145\/1008892.1008893","type":"journal-article","created":{"date-parts":[[2004,10,12]],"date-time":"2004-10-12T15:20:46Z","timestamp":1097594446000},"page":"18-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["On NP-decomposable sets"],"prefix":"10.1145","volume":"14","author":[{"given":"Uwe","family":"Sch\u00f6ning","sequence":"first","affiliation":[{"name":"Universit\u00e4t Stuttgart, Stuttgart, West-Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1982,1]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Paper presented on the \"Workshop on Recursion Theoretic Aspects of Computer Science\"","author":"Homer S.","year":"1981","unstructured":"S. Homer : Some Properties of the Lattice of NP Sets , Paper presented on the \"Workshop on Recursion Theoretic Aspects of Computer Science\" , West Lafayette , Indiana, May 18--22, 1981 S. Homer: Some Properties of the Lattice of NP Sets, Paper presented on the \"Workshop on Recursion Theoretic Aspects of Computer Science\", West Lafayette, Indiana, May 18--22, 1981"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"U. Sch\u00f6ning: A Uniform Approach to Obtain Diagonal Sets in Complexity Classes to appear in Theor. Computer Science spring 1982  U. Sch\u00f6ning: A Uniform Approach to Obtain Diagonal Sets in Complexity Classes to appear in Theor. Computer Science spring 1982","DOI":"10.1016\/0304-3975(82)90114-1"}],"container-title":["ACM SIGACT News"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008892.1008893","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1008892.1008893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:08Z","timestamp":1750282868000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1008892.1008893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":2,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["10.1145\/1008892.1008893"],"URL":"https:\/\/doi.org\/10.1145\/1008892.1008893","relation":{},"ISSN":["0163-5700"],"issn-type":[{"type":"print","value":"0163-5700"}],"subject":[],"published":{"date-parts":[[1982,1]]},"assertion":[{"value":"1982-01-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}