user

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 条
  • [31] Graph isomorphism and equality of simplices
    Protasov, V. Yu.
    [J]. MATHEMATICAL NOTES, 2009, 85 (5-6) : 724 - 732
  • [32] GRAPH ISOMORPHISM - GENERAL REMARKS
    MILLER, GL
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) : 128 - 142
  • [33] Completeness results for graph isomorphism
    Jenner, B
    Köbler, J
    McKenzie, P
    Torán, J
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2003, 66 (03) : 549 - 566
  • [34] SUBCOMPLETE GENERALIZATIONS OF GRAPH ISOMORPHISM
    HOFFMANN, CM
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (03) : 332 - 359
  • [35] The Complexity of Planar Graph Isomorphism
    Toran, Jacobo
    Toran, Jacobo
    Wagner, Fabian
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2009, (97): : 60 - 82
  • [36] OPTIMUM FEATURES AND GRAPH ISOMORPHISM
    SHAH, YJ
    DAVIDA, GI
    MCCARTHY, MK
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1974, SMC4 (03): : 313 - 319
  • [37] Graph isomorphism restricted by lists
    Klavik, Pavel
    Knop, Dusan
    Zeman, Peter
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 860 : 51 - 71
  • [38] GRAPH ISOMORPHISM IS LOW FOR PP
    KOBLER, J
    SCHONING, U
    TORAN, J
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 577 : 401 - 414
  • [39] Graph isomorphism and equality of simplices
    V. Yu. Protasov
    [J]. Mathematical Notes, 2009, 85 : 724 - 732
  • [40] On convex relaxation of graph isomorphism
    Aflalo, Yonathan
    Bronstein, Alexander
    Kimmel, Ron
    [J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2015, 112 (10) : 2942 - 2947
12345