{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:29:31Z","timestamp":1725560971979},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540206804"},{"type":"electronic","value":"9783540245971"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_35","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T03:39:20Z","timestamp":1280374760000},"page":"408-419","source":"Crossref","is-referenced-by-count":0,"title":["Stringent Relativization"],"prefix":"10.1007","author":[{"given":"Jin-Yi","family":"Cai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Osamu","family":"Watanabe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"35_CR1","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"T. Baker","year":"1975","unstructured":"Baker, T., Gill, J., Solovay, R.: Relativizatons of the P =? NP question. SIAM J. Comput.\u00a04(4), 431\u2013442 (1975)","journal-title":"SIAM J. Comput."},{"key":"35_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-75357-2","volume-title":"Structural Complexity I & II","author":"J. Balc\u00e1zar","year":"1990","unstructured":"Balc\u00e1zar, J., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity I & II. Springer, Heidelberg (1989 and 1990)"},{"key":"35_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 relativization of complexity classes. SIAM J. Comput.\u00a013, 461\u2013487 (1984)","journal-title":"SIAM J. Comput."},{"key":"35_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/3-540-45071-8_22","volume-title":"Computing and Combinatorics","author":"J.-Y. Cai","year":"2003","unstructured":"Cai, J.-Y., Watanabe, O.: On proving circuit lower bounds against the polynomial-time hierarchy: positive and negative results. In: Warnow, T.J., Zhu, B. (eds.) COCOON 2003. LNCS, vol.\u00a02697, pp. 202\u2013211. Springer, Heidelberg (2003)"},{"key":"35_CR5","unstructured":"Cai, J.-Y., Watanabe, O.: Relativized collapsing between BPP and PH under stringent oracle access (submitted)"},{"key":"#cr-split#-35_CR6.1","doi-asserted-by":"crossref","unstructured":"Cai, J.-Y.: With probability one, a random oracle separates PSPACE from the polynomial-time hierarchy. In: Proc. 18th ACM Sympos. on Theory of Comput., pp. 21-29 (1986)","DOI":"10.1145\/12130.12133"},{"key":"#cr-split#-35_CR6.2","unstructured":"The final version appeared in J. Comp. Syst. Sci., 38(1), 68-85 (1989)"},{"key":"35_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032916","volume-title":"Theory of Computational Complexity","author":"D. Du","year":"2000","unstructured":"Du, D., Ko, K.: Theory of Computational Complexity. John Wiley & Sons, Inc., Chichester (2000)"},{"key":"35_CR8","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/SFCS.1981.35","volume-title":"Proc. 22nd IEEE Symposium on Foundations of Computer Science (FOCS 1981)","author":"M. Furst","year":"1981","unstructured":"Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial time hierarchy. In: Proc. 22nd IEEE Symposium on Foundations of Computer Science (FOCS 1981), pp. 260\u2013270. IEEE, Los Alamitos (1981)"},{"key":"35_CR9","first-page":"6","volume-title":"Proc. 18th ACM Symposium on Theory of Computing (STOC 1986)","author":"J. H\u00e5stad","year":"1986","unstructured":"H\u00e5stad, J.: Almost optimal lower bounds for small depth circuits. In: Proc. 18th ACM Symposium on Theory of Computing (STOC 1986), pp. 6\u201320. ACM, New York (1986)"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1145\/800141.804678","volume-title":"Proc. 12th ACM Symposium on Theory of Computing (STOC 1980)","author":"R. Karp","year":"1980","unstructured":"Karp, R., Lipton, R.: Some connections between nonuniform and uniform complexity classes. In: Proc. 12th ACM Symposium on Theory of Computing (STOC 1980), pp. 302\u2013309. ACM, New York (1980); An extended version appeared as: Turing machines that take advice. In: L\u2019Enseignement Math\u00e9matique (2nd series) 28, pp. 191\u2013209 (1982)"},{"key":"35_CR11","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1109\/SFCS.1983.66","volume-title":"Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983)","author":"C.B. Wilson","year":"1983","unstructured":"Wilson, C.B.: Relativized circuit complexity. In: Proc. 24th IEEE Symposium on Foundations of Computer Science (FOCS 1983), pp. 329\u2013334. IEEE, Los Alamitos (1983)"},{"key":"35_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/SFCS.1985.49","volume-title":"Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS 1985)","author":"A.C. Yao","year":"1985","unstructured":"Yao, A.C.: Separating the polynomial-time hierarchy by oracles. In: Proc. 26th IEEE Symposium on Foundations of Computer Science (FOCS 1985), pp. 1\u201310. IEEE, Los Alamitos (1985)"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:46:35Z","timestamp":1558284395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}