{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:56:01Z","timestamp":1742979361927,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354666"},{"type":"electronic","value":"9783540354680"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780342_23","type":"book-chapter","created":{"date-parts":[[2006,6,28]],"date-time":"2006-06-28T02:19:46Z","timestamp":1151461186000},"page":"209-220","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration Reducibility with Polynomial Time Bounds"],"prefix":"10.1007","author":[{"given":"Charles M.","family":"Harris","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Ambos-Spies, K.: On the structure of the polynomial time degrees of recursive sets. In: Habilitationsschrift, vol.\u00a0206. Lehrstuhl f\u00fcr Informatik II, Universit\u00e4t Dortmund (1985)"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0019-9958(85)80020-6","volume":"65","author":"K. Ambos-Spies","year":"1985","unstructured":"Ambos-Spies, K.: Sublattices of the polynomial time degrees. Information and Control\u00a065(1), 63\u201384 (1985)","journal-title":"Information and Control"},{"key":"23_CR3","first-page":"95","volume-title":"Current Trends in Theoretical Computer Science","author":"K. Ambos-Spies","year":"1987","unstructured":"Ambos-Spies, K.: Polynomial time degrees of NP-sets. In: B\u00f6rger, E. (ed.) Current Trends in Theoretical Computer Science, pp. 95\u2013142. Computer Science Press, Maryland (1987)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1016\/S0049-237X(99)80034-2","volume-title":"Handbook of Computability Theory","author":"K. Ambos-Spies","year":"1999","unstructured":"Ambos-Spies, K.: Polynomial time reducibilities and degrees. In: Griffor, E.R. (ed.) Handbook of Computability Theory, pp. 683\u2013705. Elsevier, Amsterdam (1999)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third ACM Symposium on the Theory of Computing, pp. 151\u2013158. Shaker Heights, Ohio (1971)","DOI":"10.1145\/800157.805047"},{"key":"23_CR6","volume-title":"Computability Theory","author":"S.B. Cooper","year":"2004","unstructured":"Cooper, S.B.: Computability Theory. Chapman and Hall, Boca Raton (2004)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1002\/malq.19970430302","volume":"43","author":"K. Copestake","year":"1997","unstructured":"Copestake, K.: On nondeterminism, enumeration reducibility and polynomial bounds. Mathematical Logic Quarterly\u00a043, 287\u2013310 (1997)","journal-title":"Mathematical Logic Quarterly"},{"key":"23_CR8","unstructured":"Harris, C.M.: Enumeration Reducibility and Polynomial Time Bounds. PhD thesis, The University of Leeds, UK (January 2006) Available online at: \n                  \n                    http:\/\/www.maths.leeds.ac.uk\/"},{"key":"23_CR9","first-page":"85","volume-title":"Reducibility among Combinatorial Problems","author":"R.M. Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among Combinatorial Problems, pp. 85\u2013104. Plenum Press, New York (1972)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","volume":"1","author":"R. Ladner","year":"1975","unstructured":"Ladner, R., Lynch, N.A., Selman, A.L.: A comparison of polynomial time reducibilities. Theoretical Computer Science\u00a01, 103\u2013123 (1975)","journal-title":"Theoretical Computer Science"},{"key":"23_CR11","unstructured":"McEvoy, K.: The Structure of the Enumeration Degrees. Ph.D thesis, The University of Leeds (October 1984)"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1002\/malq.19710170139","volume":"17","author":"A.L. Selman","year":"1971","unstructured":"Selman, A.L.: Arithmetical reducibilities I. Zeitshrift Math. Logik Grundlagen Math.\u00a017, 335\u2013360 (1971)","journal-title":"Zeitshrift Math. Logik Grundlagen Math."},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1137\/0207035","volume":"7","author":"A.L. Selman","year":"1978","unstructured":"Selman, A.L.: Polynomial time enumeration reducibility. SIAM Journal on Computing\u00a07, 440\u2013457 (1978)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Logical Approaches to Computational Barriers"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780342_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,11]],"date-time":"2019-03-11T23:14:57Z","timestamp":1552346097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780342_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354666","9783540354680"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11780342_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}