THE ISOMORPHISM-PROBLEM IS POLYNOMIALLY SOLVABLE FOR CERTAIN GRAPH LANGUAGES

被引：0

|

作者：

SCHNITZLER, M

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1983年 / 153卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：369 / 379

页数：11

相关论文

共 50 条

[41] On the polynomially solvable problem of designing behavior of the intelligent robot
German, OV
Semeryuk, DV
AUTOMATION AND REMOTE CONTROL, 2001, 62 (02) : 181 - 189
[42] Polynomially solvable cases of the bipartite traveling salesman problem
Garcia, Alfredo
Tejel, Javier
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (02) : 429 - 438
[43] A polynomially solvable case of the three machine johnson problem
Servakh V.V.
Journal of Applied and Industrial Mathematics, 2008, 2 (3) : 397 - 405
[44] A polynomially solvable special case of the unbounded knapsack problem
Zukerman, M
Jia, L
Neame, T
Woeginger, GJ
OPERATIONS RESEARCH LETTERS, 2001, 29 (01) : 13 - 16
[45] ON THE ISOMORPHISM-PROBLEM FOR INTEGRAL GROUP-RINGS OF CIRCLE-GROUPS
ROHL, F
MATHEMATISCHE ZEITSCHRIFT, 1982, 180 (03) : 419 - 422
[46] ON THE ISOMORPHISM-PROBLEM FOR INTEGRAL GROUP-RINGS OF FINITE-GROUPS
ROGGENKAMP, KW
ZIMMERMANN, A
ARCHIV DER MATHEMATIK, 1992, 59 (06) : 534 - 544
[47] SPACE-TIME ISOMORPHISM-PROBLEM IS INTRACTABLE (NP-HARD)
KREINOVICH, V
INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 1991, 30 (09) : 1249 - 1257
[48] ON AUTOMORPHISMS OF COMPLETE ALGEBRAS AND THE ISOMORPHISM-PROBLEM FOR MODULAR GROUP-RINGS
ROHL, F
CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1990, 42 (03): : 383 - 394
[49] UNIT GROUPS OF COMPLETED MODULAR GROUP-ALGEBRAS AND THE ISOMORPHISM-PROBLEM
ROHL, F
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1991, 111 (03) : 611 - 618
[50] REPORT ON THE GRAPH ISOMORPHISM PROBLEM
Dawar, Anuj
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2016, 2016 (118): : 175 - 177

← 1 2 3 4 5 →