scientific article; zbMATH DE number 7559146
From MaRDI portal
Publication:5090487
DOI10.4230/LIPIcs.STACS.2019.37MaRDI QIDQ5090487
Saul Schleimer, Derek F. Holt, Markus Lohrey
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1808.06886
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (max. 100)
Logspace and compressed-word computations in nilpotent groups ⋮ Algorithms for contractibility of compressed curves on 3-manifold boundaries ⋮ Post's Correspondence Problem for hyperbolic and virtually nilpotent groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Knapsack in hyperbolic groups ⋮ Complexity of word problems for HNN-extensions ⋮ Compression techniques in group theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The virtual Haken conjecture (with an appendix by Ian Agol, Daniel Groves and Jason Manning).
- The word problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable.
- The simultaneous conjugacy problem in groups of piecewise linear functions.
- The isomorphism problem for all hyperbolic groups.
- Knapsack problems in products of groups
- Polynomial-time word problems.
- Coxeter groups are virtually special
- Research announcement: The structure of groups with a quasiconvex hierarchy.
- The complexity of Grigorchuk groups with application to cryptography
- Knapsack in graph groups
- Evaluation of circuits over nilpotent and polycyclic groups
- THE CONJUGACY PROBLEM IN HYPERBOLIC GROUPS FOR FINITE LISTS OF GROUP ELEMENTS
- Algorithmics on SLP-compressed strings: A survey
- Groups, Languages and Automata
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- Knapsack Problems for Wreath Products
- A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
- The Smallest Grammar Problem
- COMPRESSED WORDS AND AUTOMORPHISMS IN FULLY RESIDUALLY FREE GROUPS
- ALMOST EVERY GROUP IS HYPERBOLIC
- Finite Monoids: From Word to Circuit Evaluation
- Ackermannian Integer Compression and the Word Problem for Hydra Groups.
- POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY
- WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM
- COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS
- EFFICIENT ALGORITHMS FOR HIGHLY COMPRESSED DATA: THE WORD PROBLEM IN HIGMAN'S GROUP IS IN P
- Low-complexity computations for nilpotent subgroup problems
- The Compressed Word Problem for Groups
- Word Problems and Membership Problems on Compressed Words
- THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
- Knapsack problems in groups
- Knapsack in hyperbolic groups
This page was built for publication:
