The computational complexity of torsion-freeness of finitely presented groups
From MaRDI portal
Publication:4374809
DOI10.1017/S0004972700031014zbMath0889.03033MaRDI QIDQ4374809
Publication date: 29 May 1998
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)
03D40: Word problems, etc. in computability and recursion theory
Related Items
Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories, The uniform Martin’s conjecture for many-one degrees, The complexity of decomposability of computable rings, The isomorphism problem for torsion-free abelian groups is analytic complete, The computational complexity of module socles, Detecting properties from descriptions of groups, COMPUTABLE ABELIAN GROUPS, ENDOMORPHISMS OF RELATIVELY HYPERBOLIC GROUPS
Cites Work