{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T13:52:35Z","timestamp":1770817955787,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540167617","type":"print"},{"value":"9783540398592","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_82","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:52:16Z","timestamp":1330177936000},"page":"324-333","source":"Crossref","is-referenced-by-count":3,"title":["A uniform reduction theorem extending a result of J. Grollmann and A. Selman"],"prefix":"10.1007","author":[{"given":"Kenneth W.","family":"Regan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"1","key":"34_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/S0019-9958(85)80020-6","volume":"65","author":"K. Ambos-Spies","year":"1985","unstructured":"K. Ambos-Spies. Sublattices of the polynomial-time degrees. Information and Control 65, No. 1, April 1985, pp 63\u201384.","journal-title":"Information and Control"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"D. Angluin. Counting problems and the polynomial-time hierarchy. Theoretical Computer Science 12, No. 2, October 1980.","DOI":"10.1016\/0304-3975(80)90027-4"},{"key":"34_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139171496","volume-title":"Computability","author":"N. Cutland","year":"1980","unstructured":"N. Cutland. Computability. (Cambridge: Camb. University Press, 1980.)"},{"key":"34_CR4","unstructured":"M. Dowd. Forcing and the P hierarchy. Preprint, Rutgers Univ., 1982."},{"key":"34_CR5","volume-title":"Elements of Intuitionism","author":"M. Dummett","year":"1977","unstructured":"M. Dummett. Elements of Intuitionism. (Oxford: Clarendon Press, 1977.)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"S. Even and Y. Yacobi. Cryptography and NP-completeness. Proc. ICALP '80, Springer LNCS 80, pp. 195\u2013207.","DOI":"10.1007\/3-540-10003-2_71"},{"key":"34_CR7","volume-title":"Ph.D dissertation","author":"J. Grollmann","year":"1984","unstructured":"J. Grollmann. Ph.D dissertation, Univ. of Dortmund, W. Germany, 1984."},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"J. Grollmann and A. Selman. Complexity measures for public-key cryptosystems. Proc. 25th FOCS, Oct. 1984.","DOI":"10.1109\/SFCS.1984.715952"},{"key":"34_CR9","unstructured":"Ibid. Iowa State Univ. Technical Report TR 85-31, November 1985."},{"key":"34_CR10","unstructured":"S. Homer. Minimal degrees for polynomial reducibilities. Draft, Boston University, 1982."},{"key":"34_CR11","unstructured":"D. Kozen and M. Machtey. On relative diagonals. TR RC 8184 (#35583), IBM Thomas J. Watson Research Center, Yorktown Hts., NY 10598 USA, 1980."},{"key":"34_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","volume":"22","author":"R. Ladner","year":"1975","unstructured":"R. Ladner. On the structure of polynomial-time reducibility. J. ACM 22, 1975, pp. 155\u2013171.","journal-title":"J. ACM"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"K. Melhorn. On the size of sets of computable functions. Proc. 14th Symposium on Switching and Automata Theory (now STOC), 1973, pp 190\u2013196.","DOI":"10.1109\/SWAT.1973.23"},{"key":"34_CR14","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. (New York: McGraw-Hill, 1967)."},{"key":"34_CR15","volume-title":"Real Analysis","author":"H. Royden","year":"1963","unstructured":"H. Royden. Real Analysis. (New York: The MacMillan Company, 1963)."},{"key":"34_CR16","volume-title":"Real and Complex Analysis","author":"W. Rudin","year":"1974","unstructured":"W. Rudin. Real and Complex Analysis (2nd. edition). (New York: McGraw-Hill, 1974.)","edition":"2nd. edition"},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(82)90039-1","volume":"19","author":"A. Selman","year":"1982","unstructured":"A. Selman. Reductions on NP and P-selective sets. Theoretical Computer Science 19, 1982, pp 287\u2013304.","journal-title":"Theoretical Computer Science"},{"key":"34_CR18","first-page":"502","volume":"140","author":"A. Selman","year":"1982","unstructured":"A. Selman and Y. Yacobi. The complexity of promise problems. Proc. ICALP '82, Springer LNCS 140, 1982, pp. 502\u2013509.","journal-title":"Springer LNCS"}],"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_82.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:10:57Z","timestamp":1605625857000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]}}}