{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:05Z","timestamp":1725663065366},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_86","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:52:26Z","timestamp":1330177946000},"page":"370-375","source":"Crossref","is-referenced-by-count":0,"title":["Lower bounds by recursion theoretic arguments"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Sch\u00f6ning","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01699457","volume":"18","author":"J.L. Balc\u00e1zar","year":"1985","unstructured":"J.L. Balc\u00e1zar and U. Sch\u00f6ning, Bi-immune sets for complexity classes, Mathematical Systems Theory 18 (1985), 1\u201310.","journal-title":"Mathematical Systems Theory"},{"key":"38_CR2","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1137\/0210008","volume":"10","author":"C.H. Bennett","year":"1981","unstructured":"C.H. Bennett and J. Gill, Relative to a random oracle A, pA\u2260NPA\u2260coNPA with probability 1, SIAM Journal on Computing 10 (1981), 96\u2013113.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR3","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1137\/0206023","volume":"6","author":"L. Berman","year":"1977","unstructured":"L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM Journal on Computing 6 (1977), 305\u2013327.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR4","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers","year":"1967","unstructured":"H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"A.C. Yao, Theory and applications of trapdoor functions, 23rd IEEE Symp. Foundations of Computer Science 1982, 80\u201391.","DOI":"10.1109\/SFCS.1982.45"},{"key":"38_CR6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/0212027","volume":"12","author":"Y. Yesha","year":"1983","unstructured":"Y. Yesha, On certain polynomial-time truth-table reducibilities of complete sets to sparse sets, SIAM Journal on Computing 12 (1983), 411\u2013425.","journal-title":"SIAM Journal on Computing"},{"key":"38_CR7","doi-asserted-by":"crossref","unstructured":"P. Young, Some structural properties of polynomial reducibilities and sets in NP, Proc. 15th Ann. ACM Symp. Theory of Computing, 1983, 392\u2013401.","DOI":"10.1145\/800061.808770"}],"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_86.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T17:05:14Z","timestamp":1619543114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_86"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_86","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}