搜索结果: 1-2 共查到“群论 complexity”相关记录2条 . 查询时间(0.24 秒)
The computational complexity of recognising embeddings in finitely presented groups
Finitely presented groups embeddings Kleene’s arithmetical hierarchy decidability universal finitely presented group
2011/8/29
Abstract: We extend a result by Lempp that recognising torsion-freeness for finitely presented groups is $\Pi^{0}_{2}$-complete; we show that the problem of recognising embeddings of finitely presente...
Asymptotic invariants, complexity of groups and related problems
word problem conjugacy problem computational complexity
2011/1/19
We survey results about computational complexity of the word problem in groups, Dehn functions of groups and related problems.