Efficient Computation in Groups and Simplicial Complexes

DOI10.2307/1999079MaRDI QIDQ3669634zbMATH OpenOpenAlexFDO

Authors John Stillwell

Publication date 1983

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

zbMATH Keywords

NP-completenessHNN extensionsrelatorslength 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

• scientific article; zbMATH DE number 3504960 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3448564 (Why is no real title available?)
• scientific article; zbMATH DE number 3248792 (Why is no real title available?)
• scientific article; zbMATH DE number 3086775 (Why is no real title available?)
• Embedding Theorems for Groups
• Isotopy in surface complexes from the computational viewpoint
• Recursive unsolvability of a problem of Thue
• Subgroups of finitely presented groups
• The Word Problem for Groups
• The word problem
• The word problem
• The word problem and the isomorphism problem for groups
• Unsolvability of the knot problem for surface complexes

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3669634)