Pages that link to "Item:Q408527"

The following pages link to The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. (Q408527):

Displaying 18 items.

• Space functions and space complexity of the word problem in semigroups. (Q395608) (← links)
• Exponentially generic subsets of groups (Q716408) (← links)
• Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
• Algorithmically complex residually finite groups (Q1682244) (← links)
• Compression techniques in group theory (Q2117795) (← links)
• Efficient algorithms for highly compressed data: the word problem in generalized Higman groups is in P (Q2254512) (← links)
• Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem (Q2628315) (← links)
• Space functions of groups (Q2841376) (← links)
• A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
• The geometry of one-relator groups satisfying a polynomial isoperimetric inequality (Q4555812) (← links)
• EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P (Q4904514) (← links)
• (Q5090487) (← links)
• On one-relator groups and units of special one-relation inverse monoids (Q5877774) (← links)
• Complexity of word problems for HNN-extensions (Q5918684) (← links)
• Complexity of word problems for HNN-extensions (Q5925702) (← links)
• The fully compressed subgroup membership problem (Q6038521) (← links)
• Parallel algorithms for power circuits and the word problem of the Baumslag group (Q6083216) (← links)
• Compressed decision problems in hyperbolic groups (Q6619327) (← links)