scientific article; zbMATH DE number 3874607

MaRDI QIDQ3340146zbMATH OpenFDO

Authors Jürgen Avenhaus, Klaus Madlener

Publication date 1982

zbMATH Keywords

word problempolynomial time algorithmsfinitely generated free groupsfinite ranksubgroupsNielsen reductionshortest coset representatives

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algorithms in computer science (68W99)

Recommendations

• The Nielsen reduction and P-complete problems in free groups
• scientific article; zbMATH DE number 8769
• On an algorithm to decide whether a free group is a free factor of another
• On the complexity of intersection and conjugacy problems in free groups
• Efficiency of certain algorithms of combinatorial group theory

Cited in

(6)

• Discrete and free groups acting on locally finite trees
• Nielsen reduction in free groups with operators
• APPROXIMATION OF GEODESICS IN METABELIAN GROUPS
• Efficiency of certain algorithms of combinatorial group theory
• On the complexity of intersection and conjugacy problems in free groups
• The Nielsen reduction and P-complete problems in free groups

This page was built for publication:

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