{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:12:38Z","timestamp":1725552758276},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540340218"},{"type":"electronic","value":"9783540340225"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11750321_27","type":"book-chapter","created":{"date-parts":[[2006,5,4]],"date-time":"2006-05-04T06:11:16Z","timestamp":1146723076000},"page":"283-294","source":"Crossref","is-referenced-by-count":1,"title":["Cluster Computing and the Power of Edge Recognition"],"prefix":"10.1007","author":[{"given":"Lane A.","family":"Hemaspaandra","sequence":"first","affiliation":[]},{"given":"Christopher M.","family":"Homan","sequence":"additional","affiliation":[]},{"given":"Sven","family":"Kosub","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","series-title":"EATCS Monographs in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75357-2","volume-title":"Structural Complexity II","author":"J. Balc\u00e1zar","year":"1990","unstructured":"Balc\u00e1zar, J., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity II. EATCS Monographs in Theoretical Computer Science. Springer, Heidelberg (1990)"},{"key":"27_CR2","series-title":"EATCS Texts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-79235-9","volume-title":"Structural Complexity I","author":"J. Balc\u00e1zar","year":"1995","unstructured":"Balc\u00e1zar, J., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity I, 2nd edn. EATCS Texts in Theoretical Computer Science. Springer, Heidelberg (1995)","edition":"2"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/0213030","volume":"13","author":"R. Book","year":"1984","unstructured":"Book, R., Long, T., Selman, A.: Quantitative relativizations of complexity classes. SIAM J. Comput.\u00a013(3), 461\u2013487 (1984)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/0022-0000(85)90053-4","volume":"30","author":"R. Book","year":"1985","unstructured":"Book, R., Long, T., Selman, A.: Qualitative relativizations of complexity classes. J. Comput. Syst. Sci.\u00a030(3), 395\u2013413 (1985)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"27_CR5","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1137\/0217078","volume":"17","author":"J. Cai","year":"1988","unstructured":"Cai, J., Gundermann, T., Hartmanis, J., Hemachandra, L., Sewelson, V., Wagner, K., Wechsung, G.: The boolean hierarchy I: Structural properties. SIAM J. Comput.\u00a017(6), 1232\u20131252 (1988)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1137\/0217018","volume":"17","author":"J. Grollmann","year":"1988","unstructured":"Grollmann, J., Selman, A.: Complexity measures for public-key cryptosystems. SIAM J. Comput.\u00a017(2), 309\u2013335 (1988)","journal-title":"SIAM J. Comput."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Hemaspaandra, L., Homan, C., Kosub, S.: Cluster computing and the power of edge recognition. Technical Report TR-878, Department of Computer Science, University of Rochester, Rochester, NY (September 2005)","DOI":"10.1007\/11750321_27"},{"key":"27_CR8","unstructured":"Hemaspaandra, L., Homan, C., Kosub, S., Wagner, K.: The complexity of computing the size of an interval. Technical Report TR-856, Department of Computer Science, University of Rochester, Rochester, NY (February 2005) [9] This is an expanded version of"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.1007\/3-540-48224-5_84","volume-title":"Automata, Languages and Programming","author":"L. Hemaspaandra","year":"2001","unstructured":"Hemaspaandra, L., Kosub, S., Wagner, K.: The complexity of computing the size of an interval. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 1040\u20131051. Springer, Heidelberg (2001)"},{"issue":"5\u20136","key":"27_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0020-0190(99)00142-8","volume":"72","author":"S. Kosub","year":"1999","unstructured":"Kosub, S.: A note on unambiguous function classes. Inf. Process. Lett.\u00a072(5\u20136), 197\u2013203 (1999)","journal-title":"Inf. Process. Lett."},{"key":"27_CR11","unstructured":"Meyer, A., Paterson, M.: With what frequency are apparently intractable problems difficult? Technical Report MIT\/LCS\/TM-126, Laboratory for Computer Science, MIT, Cambridge, MA (1979)"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":": Optimal algorithms for self-reducible problems. In: Proceedings of the 3rd International Colloquium on Automata, Languages, and Programming, pp. 322\u2013337. Edinburgh University Press (1976)","DOI":"10.1016\/0304-3975(76)90070-0"},{"key":"27_CR13","unstructured":"Selman, A.: A note on adaptive vs. nonadaptive reductions to NP. Technical Report 90-20, Department of Computer Science, State University of New York at Buffalo, Buffalo, NY (September 1990)"},{"issue":"2","key":"27_CR14","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","volume":"48","author":"A. Selman","year":"1994","unstructured":"Selman, A.: A taxonomy of complexity classes of functions. J. Comput. Syst. Sci.\u00a048(2), 357\u2013381 (1994)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"27_CR15","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1137\/0219058","volume":"19","author":"K. Wagner","year":"1990","unstructured":"Wagner, K.: Bounded query classes. SIAM J. Comput.\u00a019(5), 833\u2013846 (1990)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11750321_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T09:12:42Z","timestamp":1683450762000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11750321_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540340218","9783540340225"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11750321_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}