![Complexity classes / Finite groups / Combinatorial group theory / Graph isomorphism problem / Morphisms / Hidden subgroup problem / Permutation group / Permutation / Graph canonization / ArthurMerlin protocol / Graph automorphism / NP Complexity classes / Finite groups / Combinatorial group theory / Graph isomorphism problem / Morphisms / Hidden subgroup problem / Permutation group / Permutation / Graph canonization / ArthurMerlin protocol / Graph automorphism / NP](https://www.pdfsearch.io/img/90ee952fb2764e66782da70f8e961462.jpg) Date: 2016-07-30 09:35:21Complexity classes Finite groups Combinatorial group theory Graph isomorphism problem Morphisms Hidden subgroup problem Permutation group Permutation Graph canonization ArthurMerlin protocol Graph automorphism NP | | Graph Isomorphism is in SPP V. Arvind and Piyush P Kurur Institute of Mathematical Sciences, C.I.T Campus Chennai, India email: {arvind,ppk}@imsc.ernet.in AbstractAdd to Reading ListSource URL: www.cse.iitk.ac.inDownload Document from Source Website File Size: 298,54 KBShare Document on Facebook
|