The complexity of Dehn's algorithm for word problems in groups-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The complexity of Dehn's algorithm for word problems in groups

Published:1985-12 Issue:4 Volume:6 Page:543-549
ISSN:0196-6774
Container-title:Journal of Algorithms
language:en
Short-container-title:Journal of Algorithms

Author:

Domanski B,Anshel M

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computational Mathematics,Control and Optimization

Reference9 articles.

1. String matching and algorithmic problems in free groups;Avenhaus;Rev. Columbiana Mat.,1980

2. Confluent and other types of Thue systems;Book;J. Assoc. Comput. Mach.,1982

3. The complexity of two decision problems for free groups;Domanski;Houston J. Math.,1982

4. String matching and other products;Fischer,1974

5. On real time simulation of multihead tape units;Fischer;J. Assoc. Comput. Mach.,1972

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Polynomial-time proofs that groups are hyperbolic;Journal of Symbolic Computation;2021-05

2. On the Homotopy Test on Surfaces;2012 IEEE 53rd Annual Symposium on Foundations of Computer Science;2012-10

3. ON A GENERALIZATION OF DEHN'S ALGORITHM;International Journal of Algebra and Computation;2008-11

4. THE CONJUGACY PROBLEM IN AMALGAMATED PRODUCTS I: REGULAR ELEMENTS AND BLACK HOLES;International Journal of Algebra and Computation;2007-11

5. Average-case complexity and decision problems in group theory;Advances in Mathematics;2005-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP