Asymptotic invariants, complexity of groups and related problems

被引：12
作者：
Sapir, Mark [1 ]
机构：
[1] Vanderbilt Univ, Dept Math, Nashville, TN 37240 USA
来源：
BULLETIN OF MATHEMATICAL SCIENCES | 2011年 / 1卷 / 02期
关键词：
Word problem; Conjugacy problem; Computational complexity; Dehn function; Higman embedding; Asymptotic cone; FINITELY PRESENTED GROUPS; ISOPERIMETRIC-INEQUALITIES; HYPERBOLIC GROUPS; DEHN FUNCTION; ISOMORPHISM-PROBLEM; GENERAL ALGORITHMS; POLYNOMIAL-GROWTH; CONJUGACY PROBLEM; MAPPING TORI; WORD PROBLEM;
D O I：
10.1007/s13373-011-0008-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.
引用
收藏
页码：277 / 364
页数：88
相关论文
共 242 条
  • [1] Adian S. I., 1979, ERGEBNISSE MATH IHRE, V95
  • [2] ADIAN SI, 1982, IZV AKAD NAUK SSSR M, V46, P1139
  • [3] An isoperimetric inequality for the Heisenberg groups
    Allcock, D
    [J]. GEOMETRIC AND FUNCTIONAL ANALYSIS, 1998, 8 (02) : 219 - 233
  • [4] ALONSO JM, 1995, P LOND MATH SOC, V70, P56
  • [5] Rectifiable sets in metric and Banach spaces
    Ambrosio, L
    Kirchheim, B
    [J]. MATHEMATISCHE ANNALEN, 2000, 318 (03) : 527 - 555
  • [6] [Anonymous], 1995, ENCY MATH ITS APPL
  • [7] [Anonymous], 1980, COMPUTABLE UNCOMPUTA
  • [8] [Anonymous], 1992, International Journal of Algebra and Computation, DOI [DOI 10.1142/S0218196794000026, 10.1142/ S0218196794000026]
  • [9] [Anonymous], 1943, The Journal of Symbolic Logic, DOI 10.2307/2268172
  • [10] [Anonymous], 1991, MATH APPL SOVIET SER
12345678910