{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:35:16Z","timestamp":1743024916331,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241317"},{"type":"electronic","value":"9783540305514"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30551-4_20","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T18:15:37Z","timestamp":1279044937000},"page":"209-220","source":"Crossref","is-referenced-by-count":0,"title":["Random Access to Advice Strings and Collapsing Results"],"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":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0168-0072(83)90038-6","volume":"24","author":"M. Ajtai","year":"1983","unstructured":"Ajtai, M.: ${\\Sigma_1^1}$-formulae on finite structures. Ann. Pure Applied Logic\u00a024, 1\u201348 (1983)","journal-title":"Ann. Pure Applied Logic"},{"key":"20_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method. John Wiley & Sons, Inc, Chichester (2000)"},{"issue":"4","key":"20_CR3","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":"20_CR4","volume-title":"Structural Complexity I & II","author":"J. Balc\u00e1zar","year":"1989","unstructured":"Balc\u00e1zar, J., D\u00edaz, J., Gabarr\u00f3, J.: Structural Complexity I & II. Springer, Heidelberg (1989-1990)"},{"issue":"1","key":"20_CR5","first-page":"21","volume":"38","author":"J.-Y. Cai","year":"1986","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 (STOC 1989), pp. 21\u201329 (1986); The final version appeared. J. Comp. Syst. Sci.\u00a038(1), 68\u201385 (1989)","journal-title":"J. Comp. Syst. Sci."},{"key":"20_CR6","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":"20_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":"20_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":"20_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)"},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0019-9958(86)80012-2","volume":"71","author":"H. Heller","year":"1986","unstructured":"Heller, H.: On relativized exponential and probabilistic complexity classes. Information and Control\u00a071(3), 231\u2013243 (1986)","journal-title":"Information and Control"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/S0019-9958(82)90382-5","volume":"55","author":"R. Kannan","year":"1982","unstructured":"Kannan, R.: Circuit-size lower bounds and non-reducibility to sparse sets. Information and Control\u00a055, 40\u201356 (1982)","journal-title":"Information and Control"},{"key":"20_CR12","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, i vn L\u2019Enseignement Math\u00e9matique (2nd series) 28, 191\u2013209, (1982)"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1145\/800133.804358","volume-title":"Proc. 10th ACM Symposium on Theory of Computing (STOC 1978)","author":"D. Kozen","year":"1978","unstructured":"Kozen, D.: Indexing of subrecursive classes. In: Proc. 10th ACM Symposium on Theory of Computing (STOC 1978), pp. 287\u2013295. ACM, New York (1978); The final version appeared in Theoretical Computer Science 11, 277\u2013301 (1980)"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01375474","volume":"11","author":"N. Nisan","year":"1991","unstructured":"Nisan, N.: Pseudorandom bits for constant depth circuits. Combinatorica\u00a011(1), 63\u201370 (1991)","journal-title":"Combinatorica"},{"key":"20_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs randomness. J. Comput. Syst. Sci.\u00a049, 149\u2013167 (1994)","journal-title":"J. Comput. Syst. Sci."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Razborov, A.: Lower bounds on the size of bounded depth networks over a complete basis with logical addition. In: Mathematical Notes of the Academy of Sciences of the USSR, vol.\u00a041, pp. 333\u2013338 (1987)","DOI":"10.1007\/BF01137685"},{"key":"20_CR17","first-page":"77","volume-title":"Proc. 19th ACM Symposium on Theory of Computing (STOC 1987)","author":"R. Smolensky","year":"1987","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Proc. 19th ACM Symposium on Theory of Computing (STOC 1987), pp. 77\u201382. ACM, New York (1987)"},{"key":"20_CR18","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":"20_CR19","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","Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30551-4_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T15:38:41Z","timestamp":1675265921000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-30551-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241317","9783540305514"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30551-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}