Efficient Computation in Groups and Simplicial Complexes

DOI10.2307/1999079zbMath0519.20031OpenAlexW4232508762MaRDI QIDQ3669634

John Stillwell

Publication date: 1983

Full work available at URL: https://doi.org/10.2307/1999079

zbMATH Keywords

HNN extensionsNP-completenessrelatorslength of wordsBoone-Britton groupconjugations by generatorsRE- completenessTuring machine computation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Software, source code, etc. for problems pertaining to group theory (20-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Word Problem for Groups
• Subgroups of finitely presented groups
• The word problem and the isomorphism problem for groups
• Unsolvability of the knot problem for surface complexes
• Isotopy in surface complexes from the computational viewpoint
• Recursive Unsolvability of a problem of Thue
• Embedding Theorems for Groups
• The word problem
• The word problem

This page was built for publication: Efficient Computation in Groups and Simplicial Complexes