Pages that link to "Item:Q4131647"

The following pages link to Word Problems Solvable in Logspace (Q4131647):

Displaying 50 items.

• On the power of algebraic branching programs of width two (Q260398) (← links)
• On groups that have normal forms computable in logspace. (Q375212) (← links)
• \(\mathcal C\)-graph automatic groups. (Q403809) (← links)
• The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable. (Q408527) (← links)
• On the dimension of matrix embeddings of torsion-free nilpotent groups (Q517082) (← links)
• Log-space conjugacy problem in the Grigorchuk group (Q524647) (← links)
• Advice classes of parametrized tractability (Q676315) (← links)
• Average-case complexity and decision problems in group theory. (Q703812) (← links)
• Complexity classes of equivalence problems revisited (Q716333) (← links)
• The Nielsen reduction and P-complete problems in free groups (Q760500) (← links)
• On the complexity of intersection and conjugacy problems in free groups (Q760501) (← links)
• On oblivious branching programs of linear length (Q804285) (← links)
• Partially commutative inverse monoids. (Q958191) (← links)
• Complexity, combinatorial group theory and the language of palutators (Q1105698) (← links)
• Some subclasses of context-free languages in \(NC^ 1\) (Q1112610) (← links)
• A note on representations of a certain monoid (Q1158531) (← links)
• The complexity of Grigorchuk groups with application to cryptography (Q1177176) (← links)
• Complete problems for symmetric logspace involving free groups (Q1183484) (← links)
• The ring of \(k\)-regular sequences (Q1193879) (← links)
• Nondeterministic \(NC^1\) computation (Q1276170) (← links)
• Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
• The complexity of the max word problem and the power of one-way interactive proof systems (Q1312183) (← links)
• Generic-case complexity, decision problems in group theory, and random walks. (Q1399190) (← links)
• Algorithmically complex residually finite groups (Q1682244) (← links)
• Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
• Compression techniques in group theory (Q2117795) (← links)
• The power word problem in graph products (Q2164009) (← links)
• Skew circuits of small width (Q2173307) (← links)
• Inverse monoids: decidability and complexity of algebraic questions. (Q2643082) (← links)
• Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two (Q2676823) (← links)
• Space functions of groups. (Q2841376) (← links)
• Minsky Machines and Algorithmic Problems (Q2947180) (← links)
• A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
• On the Power of Algebraic Branching Programs of Width Two (Q3012846) (← links)
• Evaluating Matrix Circuits (Q3196387) (← links)
• Lower bounds on the complexity of real-time branching programs (Q3815526) (← links)
• On the parallel complexity of linear groups (Q3988804) (← links)
• THE GROUPS OF RICHARD THOMPSON AND COMPLEXITY (Q4658702) (← links)
• COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS (Q4904513) (← links)
• Dynamic algorithms for the Dyck languages (Q5057425) (← links)
• Parallel complexity for nilpotent groups (Q5084295) (← links)
• (Q5092405) (← links)
• (Q5092480) (← links)
• Logspace and compressed-word computations in nilpotent groups (Q5100019) (← links)
• TC^0 circuits for algorithmic problems in nilpotent groups (Q5111237) (← links)
• The Bounded and Precise Word Problems for Presentations of Groups (Q5113919) (← links)
• Algorithmic problems in Engel groups and cryptographic applications (Q5124360) (← links)
• CIRCUITS, THE GROUPS OF RICHARD THOMPSON, AND coNP-COMPLETENESS (Q5470158) (← links)
• Between Broadway and the Hudson: A Bijection of Corridor Paths (Q5856390) (← links)
• Complexity of word problems for HNN-extensions (Q5918684) (← links)