{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:18:20Z","timestamp":1725455900681},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626169"},{"type":"electronic","value":"9783540683421"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0023451","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:06:33Z","timestamp":1132383993000},"page":"93-104","source":"Crossref","is-referenced-by-count":3,"title":["The operators min and max on the polynomial hierarchy"],"prefix":"10.1007","author":[{"given":"Harald","family":"Hempel","sequence":"first","affiliation":[]},{"given":"Gerd","family":"Wechsung","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,10]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity I","author":"J.L. Balc\u00e1zar","year":"1995","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz and J. Gabarr\u00f3. Structural Complexity I. Springer Berlin-Heidelberg-New York, 2nd ed., 1995.","edition":"2nd ed."},{"key":"8_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75357-2","volume-title":"Structural Complexity II","author":"J.L. Balc\u00e1zar","year":"1990","unstructured":"J.L. Balc\u00e1zar, J. D\u00edaz and J. Gabarr\u00f3. Structural Complexity II. Springer Berlin-Heidelberg-New York, 1990."},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/inco.1995.1087","volume":"119","author":"Z.-Z. Chen","year":"1995","unstructured":"Z.-Z. Chen and S. Toda. The Complexity of Selecting Maximal Solutions. Information and Computation, 119(1):231\u2013239, 1995.","journal-title":"Information and Computation"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/BF01204168","volume":"28","author":"W.I. Gasarch","year":"1995","unstructured":"W.I. Gasarch, M.W. Krentel and K.J. Rappoport. OptP as the Normal Behavior of NP-Complete Problems. Mathematical Systems Theory, 28:487\u2013514, 1995.","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/211542.211543","volume":"26","author":"L. Hemaspaandra","year":"1995","unstructured":"L. Hemaspaandra and H. Vollmer. The Satanic notations: Counting classes beyond # \u00b7 P and other definitional adventures. SIGACT News, 26(1):2\u201313, 1995.","journal-title":"SIGACT News"},{"key":"8_CR6","volume-title":"PhD thesis","author":"J. K\u00f6bler","year":"1989","unstructured":"J. K\u00f6bler. Strukturelle Komplexit\u00e4t von Anzahlproblemen. PhD thesis, Universit\u00e4t Stuttgart, Fakult\u00e4t f\u00fcr Informatik, Stuttgart, Germany, 1989."},{"key":"8_CR7","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/BF00276023","volume":"26","author":"J. K\u00f6bler","year":"1989","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning and J. Tor\u00e1n. On counting and approximation. Acta Informatica, 26:363\u2013379, 1989.","journal-title":"Acta Informatica"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"M.W. Krentel","year":"1988","unstructured":"M.W. Krentel. The complexity of optimization problems. Journal of Computer and Systems Sciences, 36:490\u2013509, 1988.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(92)90073-O","volume":"97","author":"M.W. Krentel","year":"1992","unstructured":"M.W. Krentel. Generalizations of OptP to the polynomial hierarchy. Theoretical Computer Science, 97:183\u2013198. 1992.","journal-title":"Theoretical Computer Science"},{"key":"8_CR10","volume-title":"Technical Report C-101","author":"M. Ogiwara","year":"1991","unstructured":"M. Ogiwara. Characterizing low levels of the polynomial-time hierarchy relative to C=P via metric turing machines. Technical Report C-101, Tokyo Institute of Technology, Department of Information Science, Tokyo, Japan, 1991."},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0022-0000(93)90006-I","volume":"46","author":"M. Ogiwara","year":"1993","unstructured":"M. Ogiwara and L. Hemachandra. A complexity theory for feasible closure properties. Journal of Computer and Systems Sciences, 46:295\u2013325, 1993.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"8_CR12","unstructured":"C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"C. Papadimitriou and S. Zachos. Two remarks on the power of counting. Proceedings 6th GI Conference on Theoretical Computer Science, 269\u2013276. Springer Verlag, Lecture Notes in Computer Science # 145, 1983.","DOI":"10.1007\/BFb0036487"},{"key":"8_CR14","volume-title":"PhD thesis","author":"S. Toda","year":"1991","unstructured":"S. Toda. Computational Complexity of Counting Complexity Classes. PhD thesis, Tokyo Institute of Technology, Department of Computer Science, Tokyo, Japan, 1991."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"L.G. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189\u2013201, 1979.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"L.G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3):410\u2013421, 1979.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR17","volume-title":"PhD thesis","author":"H. Vollmer","year":"1994","unstructured":"H. Vollmer. Komplexit\u00e4tsklassen von Funktionen. PhD thesis, Universit\u00e4t W\u00fcrzburg, Institut f\u00fcr Informatik, W\u00fcrzburg, Germany, 1994."},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S0129054193000195","volume":"4","author":"H. Vollmer","year":"1993","unstructured":"H. Vollmer and K.W. Wagner. The complexity of finding middle elements. International Journal of Foundations of Computer Science, 4:293\u2013307. 1993.","journal-title":"International Journal of Foundations of Computer Science"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1006\/inco.1995.1109","volume":"120","author":"H. Vollmer","year":"1995","unstructured":"H. Vollmer and K.W. Wagner. Complexity Classes of Optimization Functions. Information and Computation, 120(2):198\u2013219, 1995","journal-title":"Information and Computation"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0304-3975(86)90141-6","volume":"47","author":"K.W. Wagner","year":"1986","unstructured":"K.W. Wagner. Some observations on the connection between counting and recursion. Theoretical Computer Science, 47:131\u2013147, 1986.","journal-title":"Theoretical Computer Science"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0304-3975(87)90049-1","volume":"51","author":"K.W. Wagner","year":"1987","unstructured":"K.W. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53\u201380, 1987.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","STACS 97"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023451","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,31]],"date-time":"2024-01-31T22:58:54Z","timestamp":1706741934000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626169","9783540683421"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0023451","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}