{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T22:49:19Z","timestamp":1649112559870},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01202282","type":"journal-article","created":{"date-parts":[[2005,3,25]],"date-time":"2005-03-25T08:05:42Z","timestamp":1111737942000},"page":"187-202","source":"Crossref","is-referenced-by-count":8,"title":["On lower bounds of the closeness between complexity classes"],"prefix":"10.1007","volume":"26","author":[{"given":"Bin","family":"Fu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"1990","DOI":"10.1007\/978-3-642-97062-7","volume-title":"Structural Complexity, I, II","author":"J. Balcazar","year":"1988","unstructured":"J. Balcazar, J. Diaz, and J. Gabarro,Structural Complexity, I, II, Springer-Verlag, New York, 1988, 1990."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1137\/0217056","volume":"17","author":"R. Book","year":"1988","unstructured":"R. Book and K. Ko, On sets truth-table reducible to sparse sets,SIAM J. Comput.,17 (1988), 903?919.","journal-title":"SIAM J. Comput."},{"key":"CR3","unstructured":"B. Fu, On Closeness of NP-hard Sets to co-NP. Preprint, May, 1991."},{"key":"CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/BFb0028988","volume-title":"Theoretical Aspects of Computer Science","author":"K. Ganesan","year":"1989","unstructured":"K. Ganesan and S. Homer, Complete problems and strong polynomial reducibilities, InTheoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 349, Springer-Verlag, Berlin, 1989, pp. 240?250."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"K. Ko, Distinguishing bounded reducibility by sparse sets,Proc. 3rd Conf. on Structural Complexity Theory, 1988, pp. 181?191.","DOI":"10.1109\/SCT.1988.5278"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"M. Ogiwara and O. Watanabe, On polynomial-time bounded truth-table reducibility of NP sets to sparse sets,Proc. 22nd Symp. on Theory of Computing, 1990, pp. 457?467.","DOI":"10.1145\/100216.100276"},{"key":"CR7","first-page":"269","volume-title":"Lecture Notes in Computer Science, Vol. 145","author":"C. H. Papadimitoriou","year":"1983","unstructured":"C. H. Papadimitoriou and S. Zachos, Two remarks on the power of counting,Proc. 6th GI Conf. on Theory of Computer Science, Lecture Notes in Computer Science, Vol. 145, Springer-Verlag Berlin, 1983, pp. 269?276."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01704904","volume":"19","author":"U. Sch\u00f6ning","year":"1986","unstructured":"U. Sch\u00f6ning, Complete sets and closeness to complexity classes,Math. Systems Theory,19 (1986), 29?41.","journal-title":"Math. Systems Theory"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0022-0000(89)90020-2","volume":"39","author":"U. Sch\u00f6ning","year":"1989","unstructured":"U. Sch\u00f6ning, Probabilistic complexity classes and lowness,J. Comput. System Sci.,39 (1989), 84?100.","journal-title":"J. Comput. System Sci."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S. Toda","year":"1991","unstructured":"S. Toda, PP is as hard as the polynomial time hierarchy,SIAM J. Comput.,20 (1991), 865?877.","journal-title":"SIAM J. Comput."},{"key":"CR11","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 J. Comput.,12 (1983), 411?425.","journal-title":"SIAM J. Comput."}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202282.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01202282\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01202282","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T13:55:53Z","timestamp":1586181353000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01202282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01202282"],"URL":"https:\/\/doi.org\/10.1007\/bf01202282","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}