{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T06:18:34Z","timestamp":1770704314265,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540671411","type":"print"},{"value":"9783540465416","type":"electronic"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_36","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T16:03:24Z","timestamp":1186070604000},"page":"431-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results"],"prefix":"10.1007","author":[{"given":"Vikraman","family":"Arvind","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"K\u00f6bler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"36_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BFb0058034","volume-title":"Proc. 17th Conference on Foundations of Software Technology and Theoretical Computer Science","author":"V. Arvind","year":"1997","unstructured":"V. Arvind and J. K\u00f6bler. On resource-bounded measure and pseudorandomness. In Proc. 17th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1346 of Lecture Notes in Computer Science, pages 235\u2013249. Springer-Verlag, 1997."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"V. Arvind and J. K\u00f6bler. Graph isomorphism is low for ZPP(NP) and other lowness results. Technical Report TR99-033, Electronic Colloquium on Computational Complexity, 1999.","DOI":"10.1007\/3-540-46541-3_36"},{"issue":"2","key":"36_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1142\/S012905419500010X","volume":"6","author":"V. Arvind","year":"1995","unstructured":"V. Arvind, J. K\u00f6bler, and R. Schuler. On helping and interactive proof systems. International Journal of Foundations of Computer Science, 6(2):137\u2013153, 1995.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1137\/0405008","volume":"5","author":"L. Babai","year":"1992","unstructured":"L. Babai. Bounded round interactive proofs infinite groups. SIAM Journal of Discrete Mathematics, 5:88\u2013111, 1992.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01275486","volume":"3","author":"L. Babai","year":"1993","unstructured":"L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3:307\u2013318, 1993.","journal-title":"Computational Complexity"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0022-0000(90)90025-G","volume":"41","author":"J. L. Balc\u00e1zar","year":"1990","unstructured":"J. L. Balc\u00e1zar. Self-reducibility. Journal of Computer and System Sciences, 41:367\u2013388, 1990.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR7","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity I. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, second edition, 1995.","DOI":"10.1007\/978-3-642-79235-9"},{"issue":"1","key":"36_CR8","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1145\/200836.200880","volume":"42","author":"M. Blum","year":"1995","unstructured":"M. Blum and S. Kannan. Designing programs to check their work. Journal of the ACM, 42(1):269\u2013291, 1995.","journal-title":"Journal of the ACM"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/0213030","volume":"13","author":"R. Book","year":"1984","unstructured":"R. Book, T. Long, and A. L. Selman. Quanitative relativizations of complexity classes. SIAM Journal on Computing, 13:461\u2013487, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1006\/jcss.1996.0032","volume":"52","author":"N. Bshouty","year":"1996","unstructured":"N. Bshouty, R. Cleve, R. Gavald\u00e0, S. Kannan, and C. Tamon. Oracles and queries that are suffcient for exact learning. Journal of Computer and System Sciences, 52:421\u2013433, 1996.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-68535-9_21","volume-title":"Proc. 4th Annual International Computing and Combinatorics Conference","author":"J. Cai","year":"1998","unstructured":"J. Cai, L. A. Hemaspaandra, and G. Wechsung. Robust reductions. In Proc. 4th Annual International Computing and Combinatorics Conference, volume 1449 of Lecture Notes in Computer Science, pages 174\u2013183. Springer-Verlag, 1998."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"S. Fenner, L. Fortnow, A. Naik, and J. Rogers. Inverting onto functions. In Proc. 11th Annual IEEE Conference on Computational Complexity, pages 213\u2013222. IEEE Computer Society Press, 1996.","DOI":"10.1109\/CCC.1996.507683"},{"key":"36_CR13","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity or all languages in np have zero-knowledge proof systems. Journal of the ACM, 38:691\u2013729, 1991.","journal-title":"Journal of the ACM"},{"key":"36_CR14","unstructured":"O. Goldreich and D. Zuckerman. Another proof that $$ BPP \\subseteq PH $$ (and more). Technical Report TR97-045, Electronic Colloquium on Computational Complexity, October 1997."},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"R. M. Karp and R. J. Lipton. Some connections between nonuniform and uniform complexity classes. In Proc. 12th ACM Symposium on Theory of Computing, pages 302\u2013309. ACM Press, 1980.","DOI":"10.1145\/800141.804678"},{"key":"36_CR16","unstructured":"J. K\u00f6bler. On the structure of low sets. In Proc. 10th Structure in Complexity Theory Conference, pages 246\u2013261. IEEE Computer Society Press, 1995."},{"key":"36_CR17","doi-asserted-by":"crossref","unstructured":"J. K\u00f6bler and U. Sch\u00f6ning. On high sets for NP. In Ding-Zhu Du and K. Ko, editors, Advances in Complexity and Algorithms, pages 139\u2013156. Kluwer Academic Publishers, 1997.","DOI":"10.1007\/978-1-4613-3394-4_6"},{"key":"36_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J. K\u00f6bler","year":"1993","unstructured":"J. K\u00f6bler, U. Sch\u00f6ning, and J. Tor\u00e1n. The Graph Isomorphism Problem: Its Structural Complexity. Birkh\u00e4user, Boston, 1993."},{"key":"36_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/BFb0055799","volume-title":"Proc. 23rd Symposium on Mathematical Foundations of Computer Science","author":"J. K\u00f6bler","year":"1998","unstructured":"J. K\u00f6bler and R. Schuler. Average-case intractability vs. worst-case intractability. In Proc. 23rd Symposium on Mathematical Foundations of Computer Science, volume 1450 of Lecture Notes in Computer Science, pages 493\u2013502. Springer-Verlag, 1998."},{"issue":"1","key":"36_CR20","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1137\/S0097539795296206","volume":"28","author":"J. K\u00f6bler","year":"1999","unstructured":"J. K\u00f6bler and O. Watanabe. New collapse consequences of NP having small circuits. SIAM Journal on Computing, 28(1):311\u2013324, 1999.","journal-title":"SIAM Journal on Computing"},{"key":"36_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Computer and System Sciences, 49:149\u2013167, 1994.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR22","unstructured":"C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"issue":"1","key":"36_CR23","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/0890-5401(89)90022-9","volume":"80","author":"M. Santha","year":"1989","unstructured":"M. Santha. Relativized Arthur-Merlin versus Merlin-Arthur games. Information and Computation, 80(1):44\u201349, 1989.","journal-title":"Information and Computation"},{"key":"36_CR24","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0022-0000(83)90027-2","volume":"27","author":"U. Sch\u00f6ning","year":"1983","unstructured":"U. Sch\u00f6ning. A low and a high hierarchy within NP. Journal of Computer and System Sciences, 27:14\u201328, 1983.","journal-title":"Journal of Computer and System Sciences"},{"key":"36_CR25","doi-asserted-by":"publisher","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. Journal of Computer and System Sciences, 39:84\u2013100, 1989.","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"36_CR26","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/S0022-0000(05)80009-1","volume":"48","author":"A. L. Selman","year":"1994","unstructured":"A. L. Selman. A taxonomy of complexity classes of functions. Journal of Computer and System Sciences, 48(2):357\u2013381, 1994.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T02:56:09Z","timestamp":1737341769000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_36","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}