Login / Signup
The Complexity of Dehn's Algorithm for Word Problems in Groups.
Bernard Domanski
M. Anshel
Published in:
J. Algorithms (1985)
Keyphrases
</>
computational complexity
computational cost
space complexity
learning algorithm
k means
optimal solution
np hard
metadata
word problems