Abstract
It seems to be widely believed that the Graph Isomorphism problem in general case would not be NP-complete. The results that the problem is low for ΣstackP stack2 and for PP have supported this belief. Furthermore, it is also known that the problem is polynomial-time equivalent to its counting problem. This result also supported the belief since it is conversely believed that any NP-complete problem would not have this property. On the other hand, it is unknown whether the problem can be solved in deterministic polynomial-time. From these situations, it is widely believed that the problem seems to have an intermediate complexity between deterministic polynomial-time and NP-completeness. In this talk, I will first give a breif survey on a current status of the computational complexity of Graph Isomorphism problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Toda, S. (1999). Graph Isomorphism: Its Complexity and Algorithms. In: Rangan, C.P., Raman, V., Ramanujam, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1999. Lecture Notes in Computer Science, vol 1738. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46691-6_27
Download citation
DOI: https://doi.org/10.1007/3-540-46691-6_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66836-7
Online ISBN: 978-3-540-46691-8
eBook Packages: Springer Book Archive