scientific article
From MaRDI portal
Publication:3919078
zbMath0466.68036MaRDI QIDQ3919078
Jürgen Avenhaus, Klaus Madlener
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomial time algorithmsbreadth first search in treescombinatorial problems in free groupscomputations in free groups
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (5)
Iterative methods of program analysis: Equalities and inequalities ⋮ Efficiency of certain algorithms of combinatorial group theory ⋮ On the complexity of intersection and conjugacy problems in free groups ⋮ Model-theoretic and algorithmic questions in group theory ⋮ The base of the intersection of two free submonoids
This page was built for publication:
