Constructs logarithmic and doubly logarithmic space distinguishers for word problems in finitely generated groups and semigroups including linear ones and various products, with matching lower bounds for structures like free inverse monoids and Thompson's group F.
The Compressed Word Problem for Groups
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Streaming algorithms for groups and semigroups
Constructs logarithmic and doubly logarithmic space distinguishers for word problems in finitely generated groups and semigroups including linear ones and various products, with matching lower bounds for structures like free inverse monoids and Thompson's group F.