scientific article; zbMATH DE number 7561687
From MaRDI portal
Publication:5092405
DOI10.4230/LIPICS.MFCS.2019.43MaRDI QIDQ5092405
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.08343
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
The power word problem in graph products ⋮ Parallel complexity for nilpotent groups ⋮ Knapsack and the power word problem in solvable Baumslag–Solitar groups ⋮ Unnamed Item ⋮ Compression techniques in group theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Burnside's problem on periodic groups
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- 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 free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups
- Knapsack Problems for Wreath Products
- Efficient Computation in Groups Via Compression
- Word Problems Solvable in Logspace
- Finite Monoids: From Word to Circuit Evaluation
- POWER CIRCUITS, EXPONENTIAL ALGEBRA, AND TIME COMPLEXITY
- Parallel identity testing for skew circuits with big powers and applications
- WORD-HYPERBOLIC GROUPS HAVE REAL-TIME WORD PROBLEM
- TC^0 circuits for algorithmic problems in nilpotent groups
- Computational Complexity
- Uniqueness Theorems for Periodic Functions
- Membership Problem for the Modular Group
- The Compressed Word Problem for Groups
- DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
- Word Problems and Membership Problems on Compressed Words
- Knapsack problems in groups
- The word problem
This page was built for publication:
