Reductions to Graph Isomorphism
We show that several reducibility notions coincide when applied to the Graph Isomorphism (GI) problem. In particular we show that if a set is many-one logspace reducible to GI, then it is in fact many-one AC 0 reducible to GI. For the case of Turing reducibilities we show that for any k ≥ 0 an NC k + 1 reduction to GI can be transformed into an AC k reduction to the same problem.
KeywordsComputational complexity reducibilities graph isomorphism
Unable to display preview. Download preview PDF.
- 7.Köbler, J., Schöning, U., Torán, J.: Graph Isomorphism: its Structural Complexity, Birkhäuser, Boston (1992)Google Scholar