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 条
  • [21] On the Hardness of the Finite Field Isomorphism Problem
    Das, Dipayan
    Joux, Antoine
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2023, PT V, 2023, 14008 : 343 - 359
  • [22] Graph Isomorphism is Not AC(0)-Reducible to Group Isomorphism
    Chattopadhyay, Arkadev
    Toran, Jacobo
    Wagner, Fabian
    [J]. ACM TRANSACTIONS ON COMPUTATION THEORY, 2013, 5 (04)
  • [23] GRAPH ALGEBRAS AND THE GRAPH ISOMORPHISM-PROBLEM
    PONOMARENKO, IN
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 1994, 5 (05) : 277 - 286
  • [24] Mixed graph representation and mixed graph isomorphism
    [J]. Mohammed, Abdelkadir Muzey (abdelkadirmuzey@yahoo.com), 1600, Gazi Universitesi (30):
  • [25] 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
  • [26] THE GRAPH ISOMORPHISM-PROBLEM
    LIU, X
    KLEIN, DJ
    [J]. JOURNAL OF COMPUTATIONAL CHEMISTRY, 1991, 12 (10) : 1243 - 1251
  • [27] REPORT ON THE GRAPH ISOMORPHISM PROBLEM
    Dawar, Anuj
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2016, 2016 (118): : 175 - 177
  • [28] Improved random graph isomorphism
    Czajka, Tomek
    Pandurangan, Gopal
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2008, 6 (01) : 85 - 92
  • [29] A Geometric Approach to Graph Isomorphism
    Aurora, Pawan
    Mehta, Shashank K.
    [J]. ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 674 - 685
  • [30] NODE PARTITIONING FOR GRAPH ISOMORPHISM
    HINTEREGGER, J
    TINHOFER, G
    [J]. COMPUTING, 1977, 18 (04) : 351 - 359
12345