On the complexity of the endomorphism problem for free groups.

MaRDI QIDQ2759639zbMATH OpenFDO

Authors Charles C. Sims

Publication date 2001

zbMATH Keywords

endomorphism problemendomorphismsfree groupspolynomial time algorithms

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• POLYNOMIAL-TIME COMPLEXITY FOR INSTANCES OF THE ENDOMORPHISM PROBLEM IN FREE GROUPS
• Algorithmic problems for free-Abelian times free groups.
• The monomorphism problem in free groups.
• On the complexity of intersection and conjugacy problems in free groups
• The twisted conjugacy problem for finitely generated free groups.

Cited in

(6)

• Undecidability of the freedom problem for 3-manifold groups.
• Algorithmic problems for free-Abelian times free groups.
• scientific article; zbMATH DE number 4093751 (Why is no real title available?)
• POLYNOMIAL-TIME COMPLEXITY FOR INSTANCES OF THE ENDOMORPHISM PROBLEM IN FREE GROUPS
• Decidability of the Brinkmann problems for endomorphisms of the free group
• The monomorphism problem in free groups.

This page was built for publication: On the complexity of the endomorphism problem for free groups.

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