Showing cs.CCShow all
3 papers · 1 filter
cs.CC2020
Equation satisfiability in solvable groups
Paweł Idziak, Piotr Kawałek, Jacek Krzaczkowski +1
The study of the complexity of the equation satisfiability problem in finite groups had been initiated by Goldmann and Russell (2002) where they showed that this problem is in poly…
cs.CC2020
Hardness of equations over finite solvable groups under the exponential time hypothesis
Armin Weiß
Goldmann and Russell (2002) initiated the study of the complexity of the equation satisfiability problem in finite groups by showing that it is in P for nilpotent groups while it i…
cs.CC2016
A Logspace Solution to the Word and Conjugacy problem of Generalized Baumslag-Solitar Groups
Armin Weiß
Baumslag-Solitar groups were introduced in 1962 by Baumslag and Solitar as examples for finitely presented non-Hopfian two-generator groups. Since then, they served as examples for…