{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:10:26Z","timestamp":1725455426959},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016264","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"396-404","source":"Crossref","is-referenced-by-count":3,"title":["Nondeterministic Turing machines with modified acceptance"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Gundermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerd","family":"Wechsung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","volume":"55","author":"A. Blass","year":"1982","unstructured":"Blass, A., Yu. Gurevich, On the unique satisfiability problem. Inf. & Contr. 55 (1982), 80\u201388.","journal-title":"Inf. & Contr."},{"key":"35_CR2","doi-asserted-by":"crossref","unstructured":"Cai, Jin-yi, L. Hemachandra, The Boolean Hierarchy: Hardware over NP. Reprint Cornell Comp. Sc. Dept., 1985.","DOI":"10.1007\/3-540-16486-3_93"},{"key":"35_CR3","unstructured":"Gundermann, Th., G. Wechsung, Relativizing the Hausdorff hierarchy generated by NP. To appear."},{"key":"35_CR4","unstructured":"Counting classes with finite acceptance types. To appear."},{"key":"35_CR5","unstructured":"Hausdorff, F., Grundz\u00fcge der Mengenlehre, Leipzig 1914."},{"key":"35_CR6","unstructured":"K\u00f6bler, J., U. Sch\u00f6ning, The difference and truth-table hierarchies for NP. Submitted to RAIRO Inf. th\u00e9or."},{"key":"35_CR7","first-page":"244","volume":"28","author":"C. Papadimitriou","year":"1984","unstructured":"Papadimitriou, Ch.H., M. Yannakakis, The complexity of facets (and some facets of complexity). 14th STOC (1982), 255\u2013260. See also: JCSS 28 (1984), 244\u2013259.","journal-title":"JCSS"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Valiant, L.G., V.V. Vazirani, NP is as easy as detecting unique solutions. 17th STOC (1985), 458\u2013563.","DOI":"10.1145\/22145.22196"},{"key":"35_CR9","unstructured":"Wagner, K., More complicated questions about Maxima and Minima and some closures of NP. To appear"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Wechsung, G., On the Boolean closure of NP. Proc. FCT'85, LNCS 199, 485\u2013493.","DOI":"10.1007\/BFb0028832"},{"key":"35_CR11","unstructured":"Wechsung, G., K. Wagner, On the Boolean closure of NP. Submitted to JCSS."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016264.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:35:52Z","timestamp":1607549752000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0016264","relation":{},"subject":[]}}