Reductions to Graph Isomorphism

被引：3
|
作者：
Toran, Jacobo [1 ]
机构：
[1] Univ Ulm, Inst Theoret Informat, D-89069 Ulm, Germany
来源：
THEORY OF COMPUTING SYSTEMS | 2010年 / 47卷 / 01期
关键词：
Computational complexity; Reducibilities; Graph isomorphism;
D O I：
10.1007/s00224-008-9159-1
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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 NCk+1 reduction to GI can be transformed into an AC(k) reduction to the same problem.
引用
收藏
页码：288 / 299
页数：12
相关论文
共 50 条
  • [31] FPGA Placement by Graph Isomorphism
    Savarbaghi, Hossein Omidian
    Bazagran, Kia
    [J]. FPGA 11: PROCEEDINGS OF THE 2011 ACM/SIGDA INTERNATIONAL SYMPOSIUM ON FIELD PROGRAMMABLE GATE ARRAYS, 2011, : 284 - 284
  • [32] REPORT ON THE GRAPH ISOMORPHISM PROBLEM
    Dawar, Anuj
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2016, 2016 (118): : 175 - 177
  • [33] Graph isomorphism and equality of simplices
    Protasov, V. Yu.
    [J]. MATHEMATICAL NOTES, 2009, 85 (5-6) : 724 - 732
  • [34] 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
  • [35] GRAPH ISOMORPHISM - GENERAL REMARKS
    MILLER, GL
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1979, 18 (02) : 128 - 142
  • [36] 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
  • [37] OPTIMUM FEATURES AND GRAPH ISOMORPHISM
    SHAH, YJ
    DAVIDA, GI
    MCCARTHY, MK
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1974, SMC4 (03): : 313 - 319
  • [38] Graph isomorphism restricted by lists
    Klavik, Pavel
    Knop, Dusan
    Zeman, Peter
    [J]. THEORETICAL COMPUTER SCIENCE, 2021, 860 : 51 - 71
  • [39] SUBCOMPLETE GENERALIZATIONS OF GRAPH ISOMORPHISM
    HOFFMANN, CM
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1982, 25 (03) : 332 - 359
  • [40] Graph isomorphism and equality of simplices
    V. Yu. Protasov
    [J]. Mathematical Notes, 2009, 85 : 724 - 732
12345