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 条
  • [41] On the geometric graph isomorphism problem
    Evdokimov, SA
    Ponomarenko, IN
    [J]. JOURNAL OF PURE AND APPLIED ALGEBRA, 1997, 117 : 253 - 276
  • [42] GRAPH ISOMORPHISM IS IN THE LOW HIERARCHY
    SCHONING, U
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1987, 247 : 114 - 124
  • [43] A Partition Method for Graph Isomorphism
    Tian, Lijun
    Liu, Chaoqun
    Xie, Jianquan
    [J]. INTERNATIONAL CONFERENCE ON SOLID STATE DEVICES AND MATERIALS SCIENCE, 2012, 25 : 1761 - 1768
  • [44] Practical graph isomorphism, II
    McKay, Brendan D.
    Piperno, Adolfo
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 2014, 60 : 94 - 112
  • [45] GRAPH ISOMORPHISM IS IN THE LOW HIERARCHY
    SCHONING, U
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1988, 37 (03) : 312 - 323
  • [46] Subgraph isomorphism in graph classes
    Kijima, Shuji
    Otachi, Yota
    Saitoh, Toshiki
    Uno, Takeaki
    [J]. DISCRETE MATHEMATICS, 2012, 312 (21) : 3164 - 3173
  • [47] Graph isomorphism and genotypical houses
    Dalton, RC
    Kirsan, C
    [J]. Space Syntax 5th International Symposium, Vol 2, Proceedings, 2005, : 15 - 28
  • [48] Two graph isomorphism polytopes
    Onn, Shmuel
    [J]. DISCRETE MATHEMATICS, 2009, 309 (09) : 2934 - 2936
  • [49] On graph isomorphism determining problem
    Ai-Zabi, Bilal Radi A'Ggel
    Kernytskyy, Andriy
    Lobur, Mykhaylo
    Tkatchenko, Serhiy
    [J]. PERSPECTIVE TECHNOLOGIES AND METHODS IN MEMS DESIGN, 2008, : 84 - 84
  • [50] A METHOD OF DETERMINING GRAPH ISOMORPHISM
    POGREBNOI, VK
    [J]. CYBERNETICS, 1982, 18 (02): : 151 - 158
12345