Pages that link to "Item:Q5405102"
From MaRDI portal
The following pages link to The Compressed Word Problem for Groups (Q5405102):
Displaying 38 items.
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- The compressed word problem in relatively hyperbolic groups (Q2153344) (← links)
- The power word problem in graph products (Q2164009) (← links)
- Cadences in grammar-compressed strings (Q2232293) (← links)
- An automaton group with \textsf{PSPACE}-complete word problem (Q2701072) (← links)
- Deciding Equivalence of Linear Tree-to-Word Transducers in Polynomial Time (Q2817401) (← links)
- Efficient algorithms for highly compressed data: the word problem in Higman's group is in P (Q2904763) (← links)
- Parallel Identity Testing for Skew Circuits with Big Powers and Applications (Q2946414) (← links)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups (Q2975251) (← links)
- GROUPS WITH CONTEXT-FREE REDUCED WORD PROBLEM (Q3146308) (← links)
- Evaluating Matrix Circuits (Q3196387) (← links)
- Solutions to twisted word equations and equations in virtually free groups (Q3299596) (← links)
- Equality Testing of Compressed Strings (Q3449353) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- Parallel identity testing for skew circuits with big powers and applications (Q4687480) (← links)
- Low-complexity computations for nilpotent subgroup problems (Q4968234) (← links)
- Equivalence of Linear Tree Transducers with Output in the Free Group (Q5041262) (← links)
- (Q5089240) (← links)
- (Q5090487) (← links)
- (Q5092405) (← links)
- (Q5092480) (← links)
- Word Problems and Membership Problems on Compressed Words (Q5470731) (← links)
- Complexity of word problems for HNN-extensions (Q5918684) (← links)
- Complexity of word problems for HNN-extensions (Q5925702) (← links)
- Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)
- Knapsack and the power word problem in solvable Baumslag–Solitar groups (Q6159137) (← links)
- Algorithms for contractibility of compressed curves on 3-manifold boundaries (Q6174804) (← links)
- The word problem for finitary automaton groups (Q6175091) (← links)
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete (Q6178465) (← links)
- The power word problem in graph products (Q6580077) (← links)
- Subgroup membership in \(\mathrm{GL}(2, \mathrm{Z})\) (Q6614621) (← links)
- Compressed decision problems in hyperbolic groups (Q6619327) (← links)
- Identity testing for radical expressions (Q6649437) (← links)
