{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:18Z","timestamp":1761611298115},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_93","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:53:13Z","timestamp":1330177993000},"page":"434-443","source":"Crossref","is-referenced-by-count":9,"title":["More complicated questions about maxima and minima, and some closures of NP"],"prefix":"10.1007","author":[{"given":"Klaus W.","family":"Wagner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"45_CR1","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S., Computers and Intractibility: A Guide to the Theory of NP-Completeness, Freeman, San Francisco 1979"},{"key":"45_CR2","unstructured":"Hausdorff, F., Grundz\u00fcge der Mengenlehre, Leipzig 1914"},{"key":"45_CR3","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0196-6774(85)90046-X","volume":"6","author":"D.S. Johnson","year":"1985","unstructured":"Johnson, D.S., The NP-completeness column: an ongoing guide 15th edition, Journal of Algorithms 6(1985), 291\u2013305","journal-title":"Journal of Algorithms"},{"key":"45_CR4","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., The difference and truth-table hierarchies for NP, manuscript 1985"},{"key":"45_CR5","first-page":"19","volume":"10","author":"R.E. Ladner","year":"1976","unstructured":"Ladner, R.E., Lynch, N.A., Relativizations of questions about log space computability, MST 10(1976), 19\u201332","journal-title":"MST"},{"key":"45_CR6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R.E. Ladner","year":"1975","unstructured":"Ladner, R.E., Lynch, N.A., Selman, A.L., A comparison of polynomial time reducibilities, TCS 1(1975), 103\u2013123","journal-title":"TCS"},{"key":"45_CR7","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1145\/62.322435","volume":"31","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., On the complexity of unique solutions, JACM 31(1984), 392\u2013400","journal-title":"JACM"},{"key":"45_CR8","first-page":"244","volume":"28","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Yannakakis, M., 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":"45_CR9","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R., Word problems requiring exponential time, 5th STOC (1973), 1\u20139","DOI":"10.1145\/800125.804029"},{"key":"45_CR10","first-page":"1","volume":"3","author":"L.J. Stockmeyer","year":"1977","unstructured":"Stockmeyer, L.J., The polynomial-time hierarchy, TSC 3(1977), 1\u201322","journal-title":"TSC"},{"key":"45_CR11","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"Wagner, K., On \u03c9-regular sets, Inf.&Contr. 43(1979), 123\u2013177","journal-title":"Inf.&Contr."},{"key":"45_CR12","unstructured":"Wagner, K., Compact descriptions and the counting polynomial-time hierarchy, Proc. 2nd Frege Conf. (1984), 383\u2013392"},{"key":"45_CR13","first-page":"544","volume":"176","author":"K. Wagner","year":"1984","unstructured":"Wagner, K., The complexity of graphs with regularities, Proc. 11th MFCS Conf., LNCS 176 (1984), 544\u2013552","journal-title":"Proc. 11th MFCS Conf., LNCS"},{"key":"45_CR14","first-page":"485","volume":"199","author":"G. Wechsung","year":"1985","unstructured":"Wechsung G., On the Boolean closure of NP, Proc. FCT Conf. 1985, LNCS 199 (1985), 485\u2013493","journal-title":"Proc. FCT Conf. 1985, LNCS"},{"key":"45_CR15","unstructured":"Wechsung, G., Wagner, K.W., On the Boolean closure of NP, submitted for publication."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_93.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:11:00Z","timestamp":1605625860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_93"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_93","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}