The following pages link to The word problem (Q5895987):
Displaying 42 items.
- Word problems (Q4170710) (← links)
- Recursively enumerable sets and degrees (Q4184825) (← links)
- DEHN FUNCTION AND LENGTH OF PROOFS (Q4464963) (← links)
- Computable topological groups and Pontryagin duality (Q4691089) (← links)
- The word problem for division rings (Q4774033) (← links)
- WHAT DO TOPOLOGISTS WANT FROM SEIBERG–WITTEN THEORY? (Q4792855) (← 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)
- THE SUBGROUP IDENTIFICATION PROBLEM FOR FINITELY PRESENTED GROUPS (Q4923207) (← links)
- The isomorphism problem for finite extensions of free groups is in PSPACE (Q5002826) (← links)
- On some algorithmic problems for groups and monoids (Q5055802) (← links)
- On the homeomorphism problem for 4-manifolds (Q5076394) (← links)
- Parallel complexity for nilpotent groups (Q5084295) (← links)
- (Q5092405) (← links)
- (Q5092480) (← links)
- TC^0 circuits for algorithmic problems in nilpotent groups (Q5111237) (← links)
- The Bounded and Precise Word Problems for Presentations of Groups (Q5113919) (← links)
- (Q5115795) (← links)
- Gröbner–Shirshov bases and their calculation (Q5172855) (← links)
- Decision and Search in Non-Abelian Cramer-Shoup Public Key Cryptosystem (Q5189803) (← links)
- Space Complexity and Word Problems of Groups (Q5189807) (← links)
- The Developments of the Concept of Machine Computability from 1936 to the 1960s (Q5250213) (← links)
- The post correspondence problem (Q5556433) (← links)
- The equivalence of some general combinatorial decision problems (Q5556434) (← links)
- A complex of problems proposed by Post (Q5557938) (← links)
- Hierarchies of Computable groups and the word problem (Q5567869) (← links)
- The order problem and the power problem for free product sixth-groups (Q5591518) (← links)
- Some Undecidable Problems in Group Theory (Q5675710) (← links)
- Computability Theory and Differential Geometry (Q5717234) (← links)
- Groups With Two Generators Having Unsolvable Word Problem and Presentations of Mihailova Subgroups of Braid Groups (Q5740571) (← links)
- (Q5881549) (← 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)
- Word problems and ceers (Q6096328) (← links)
- Classifying word problems of finitely generated algebras via computable reducibility (Q6116397) (← links)
- Separating notions in effective topology (Q6142834) (← links)
- An arithmetic analysis of closed surfaces (Q6567114) (← links)
- Counting vanishing matrix-vector products (Q6575406) (← links)
- The power word problem in graph products (Q6580077) (← links)
- Counting vanishing matrix-vector products (Q6639735) (← links)
- Decidability of membership problems for flat rational subsets of \(\mathrm{GL}(2,\mathbb{Q})\) and singular matrices (Q6652394) (← links)
