![Computational complexity theory / Theory of computation / Complexity classes / Graph isomorphism problem / NP / PP / Low / Graph automorphism / Hidden subgroup problem / Time complexity / P / Chromatic polynomial Computational complexity theory / Theory of computation / Complexity classes / Graph isomorphism problem / NP / PP / Low / Graph automorphism / Hidden subgroup problem / Time complexity / P / Chromatic polynomial](https://www.pdfsearch.io/img/76f912bd72b33f44930e0dff3414ccc7.jpg) Date: 2016-07-30 09:35:21Computational complexity theory Theory of computation Complexity classes Graph isomorphism problem NP PP Low Graph automorphism Hidden subgroup problem Time complexity P Chromatic polynomial | | Graph Isomorphism is in SPP ? V. Arvind ∗ and Piyush P Kurur 1 Institute of Mathematical Sciences, Chennai, India Abstract We show that Graph Isomorphism is in the complexity class SPP, and hence it isAdd to Reading ListSource URL: www.cse.iitk.ac.inDownload Document from Source Website File Size: 287,67 KBShare Document on Facebook
|