Back to Results
First PageMeta Content
Computational 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 is
Add to Reading List

Document Date: 2016-07-30 09:35:21

Open Document

File Size: 287,67 KB

Share Result on Facebook
UPDATE