On the hardness of graph isomorphism

被引：9
|
作者：
Torán, J [1 ]
机构：
[1] Univ Ulm, Abt Theoret Informat, D-89069 Ulm, Germany
来源：
41ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2000年
关键词：
D O I：
10.1109/SFCS.2000.892080
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that the graph isomorphism problem is hard under logarithmic space many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space), for every logarithmic space modular class Mod(k)L and for the class DET of problems NC1 reducible to the determinant. These are the strongest existing hardness results for the graph isomorphism problem, and imply a randomized logarithmic space reduction from the perfect matching problem to graph isomorphism.
引用
收藏
页码：180 / 186
页数：7
相关论文
共 50 条
  • [1] On the hardness of graph isomorphism
    Torán, J
    [J]. SIAM JOURNAL ON COMPUTING, 2004, 33 (05) : 1093 - 1108
  • [2] Isomorphism of the graph
    Wu, Huaan
    [J]. DCABES 2007 Proceedings, Vols I and II, 2007, : 1104 - 1106
  • [3] ON GRAPH ISOMORPHISM AND GRAPH AUTOMORPHISM
    ZIVKOVIC, TP
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 1991, 8 (1-3) : 19 - 37
  • [4] Note on the hardness of tree isomorphism
    Jenner, B
    McKenzie, P
    Toran, J
    [J]. THIRTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY - PROCEEDINGS, 1998, : 101 - 105
  • [5] Reductions to graph isomorphism
    Toran, Jacobo
    [J]. FSTTCS 2007: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2007, 4855 : 158 - 167
  • [6] RANDOM GRAPH ISOMORPHISM
    BABAI, L
    ERDOS, P
    SELKOW, SM
    [J]. SIAM JOURNAL ON COMPUTING, 1980, 9 (03) : 628 - 635
  • [7] Reductions to Graph Isomorphism
    Jacobo Torán
    [J]. Theory of Computing Systems, 2010, 47 : 288 - 299
  • [8] On graph isomorphism for restricted graph classes
    Koebler, Johannes
    [J]. LOGICAL APPROACHES TO COMPUTATIONAL BARRIERS, PROCEEDINGS, 2006, 3988 : 241 - 256
  • [9] Reductions to Graph Isomorphism
    Toran, Jacobo
    [J]. THEORY OF COMPUTING SYSTEMS, 2010, 47 (01) : 288 - 299
  • [10] Graph fibrations, graph isomorphism, and pagerank
    Boldi, Paolo
    Lonati, Violetta
    Santini, Massimo
    Vigna, Sebastiano
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2006, 40 (02): : 227 - 253
12345