{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T21:01:32Z","timestamp":1746306092576,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1181999","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T15:35:00Z","timestamp":1056641700000},"page":"743-750","source":"Crossref","is-referenced-by-count":19,"title":["Graph isomorphism is in SPP"],"prefix":"10.1109","author":[{"given":"V.","family":"Arvind","sequence":"first","affiliation":[]},{"given":"P.P.","family":"Kurur","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"journal-title":"Finite Permutation Groups","year":"1964","author":"weilandt","key":"22"},{"article-title":"Quantum computer algorithms","year":"1999","author":"mosca","key":"17"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039599"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579204"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(79)90004-8"},{"key":"13","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01200427","article-title":"Graph isomorphism is low for PP","volume":"2","author":"ko?bler","year":"1992","journal-title":"Computational Complexity"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"11","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-11493-9","author":"hoffmann","year":"1982","journal-title":"Group-Theoretic Algorithms and Graph Isomorphism"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/378580.378679"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0058033"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808746"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1137\/0405008"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00100-4"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335392"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/SCT.1991.160241"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90232-8"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715919"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.34"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1998.694606"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","acronym":"SFCS-02","location":"Vancouver, BC, Canada"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01181999.pdf?arnumber=1181999","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T22:46:26Z","timestamp":1497566786000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1181999\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1181999","relation":{},"subject":[]}}