The following pages link to Polynomial-time word problems. (Q951964):
Displaying 22 items.
- Non-commutative lattice problems (Q285583) (← links)
- A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid (Q512189) (← links)
- Compressed word problems in HNN-extensions and amalgamated products (Q639849) (← links)
- Cryptanalysis of a combinatorial public key cryptosystem (Q1676249) (← links)
- Compression techniques in group theory (Q2117795) (← links)
- Compressed Membership in Automata with Compressed Labels (Q3007633) (← links)
- Compressed Word Problems in HNN-Extensions and Amalgamated Products (Q3392958) (← links)
- (Q3629661) (← links)
- Taming the hydra: The word problem and extreme integer compression (Q4554889) (← links)
- The primitivity index function for a free group, and untangling closed curves on hyperbolic surfaces.<i>With the appendix by Khalid Bou–Rabee</i> (Q4614765) (← links)
- Polynomial braid combing (Q4629388) (← links)
- COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS (Q4904513) (← links)
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)
- (Q5090487) (← links)
- Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
- (Q5150533) (← links)
- Some aspects of the SD-world (Q5236822) (← links)
- SLP compression for solutions of equations with constraints in free and hyperbolic groups (Q5246505) (← links)
- Complexity of word problems for HNN-extensions (Q5925702) (← links)
- The fully compressed subgroup membership problem (Q6038521) (← links)
- Algorithms for contractibility of compressed curves on 3-manifold boundaries (Q6174804) (← links)
- Compressed decision problems in hyperbolic groups (Q6619327) (← links)
