scientific article; zbMATH DE number 3784868
From MaRDI portal
Publication:3962990
Complexity of computation (including implicit computational complexity) (03D15) Word problems, etc. in computability and recursion theory (03D40) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Analysis of algorithms and problem complexity (68Q25)
Cited in
(6)- Complexity, combinatorial group theory and the language of palutators
- The complexity of Grigorchuk groups with application to cryptography
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- On groups that have normal forms computable in logspace.
- On the parallel complexity of linear groups
- Logspace computations in graph products
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962990)
