Efficiency of certain algorithms of combinatorial group theory

DOI10.1007/BF01078821MaRDI QIDQ3791335zbMATH OpenFDO

Authors S. L. Krivoj

Publication date 1985

Published in Cybernetics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01078821

zbMATH Keywords

efficient algorithmsfinitely generated free groupsNielsen reduction process

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Free nonabelian groups (20E05) Generators, relations, and presentations of groups (20F05) Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 3874607
• On the complexity of intersection and conjugacy problems in free groups
• Implementation of some algorithms of combinatorial group theory in the algebraic programming system APS-1
• scientific article; zbMATH DE number 8769
• Implementation of the Nielsen algorithm in the algebraic programming system APS-1

Cites work

• scientific article; zbMATH DE number 3731337 (Why is no real title available?)
• THE ABSTRACT THEORY OF AUTOMATA

Cited in

(6)

• Implementation of some algorithms of combinatorial group theory in the algebraic programming system APS-1
• scientific article; zbMATH DE number 3874607 (Why is no real title available?)
• scientific article; zbMATH DE number 3877408 (Why is no real title available?)
• scientific article; zbMATH DE number 8769 (Why is no real title available?)
• Representation algorithms in some free groups
• On the complexity of intersection and conjugacy problems in free groups

This page was built for publication: Efficiency of certain algorithms of combinatorial group theory

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