Graph isomorphism is in the low hierarchy

  • Uwe Schöning
Contributed Papers Complexity

DOI: 10.1007/BFb0039599

Part of the Lecture Notes in Computer Science book series (LNCS, volume 247)
Cite this paper as:
Schöning U. (1987) Graph isomorphism is in the low hierarchy. In: Brandenburg F.J., Vidal-Naquet G., Wirsing M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg

Abstract

It is shown that the graph isomorphism problem is located in the low hierarchy in NP. This implies that this problem is not NP-complete (not even under weaker forms of polynomial-time reducibilities, such as γ-reducibility) unless the polynomial-time hierarchy collapses.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1987

Authors and Affiliations

  • Uwe Schöning
    • 1
  1. 1.EWH Koblenz, InformatikKoblenzWest Germany

Personalised recommendations