Pages that link to "Item:Q3499779"
From MaRDI portal
The following pages link to Efficient Computation in Groups Via Compression (Q3499779):
Displaying 14 items.
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Knapsack in graph groups (Q1702854) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- The power word problem in graph products (Q2164009) (← links)
- The complexity of compressed membership problems for finite automata (Q2254509) (← links)
- On secret sharing protocols (Q2975247) (← links)
- Compressed Membership in Automata with Compressed Labels (Q3007633) (← links)
- Compressed Word Problems in HNN-Extensions and Amalgamated Products (Q3392958) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- AUTOMORPHISMS OF PARTIALLY COMMUTATIVE GROUPS II: COMBINATORIAL SUBGROUPS (Q4902686) (← links)
- (Q5092405) (← links)
- Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
- (Q5150533) (← links)
- The power word problem in graph products (Q6580077) (← links)
