Theoretical Computer Science · 1984 · 31 citations · 5 references
Natural SciencesComputer ScienceMathematicsCombinatoricsGalois TheoryGraph TheoryGroup Theory#P-complete ProblemsComplete ProblemsComplexity-theoretic ReductionsFree GroupsNp-complete Problems
5
P. M. Cohn, Wilhelm Magnus, A. Karrass et al. · American Mathematical Monthly · 1967 · 1.3K citations
Gian‐Carlo Rota · Advances in Mathematics · 1978 · 866 citations
Word Problems Solvable in Logspace
Richard J. Lipton, Yechezkel Zalcstein · Journal of the ACM · 1977 · 141 citations · Full text
String matching and algorithmic problems in free groups
Jürgen Avenhaus, Klaus Madlener · 1980 · 15 citations