scientific article; zbMATH DE number 7559438
From MaRDI portal
Publication:5089240
DOI10.4230/LIPIcs.MFCS.2020.67MaRDI QIDQ5089240
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/2002.03837
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (4)
Decidability problem for exponential equations in finitely presented groups ⋮ Knapsack and the power word problem in solvable Baumslag–Solitar groups ⋮ On the expressiveness of Büchi arithmetic ⋮ Compression techniques in group theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Knapsack problem for nilpotent groups
- Wreath products and finitely presented groups
- Knapsack problems in products of groups
- Logic and \(p\)-recognizable sets of integers
- Knapsack in graph groups
- Evaluation of circuits over nilpotent and polycyclic groups
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs
- Weak Second‐Order Arithmetic and Finite Automata
- Knapsack Problems for Wreath Products
- Very Fast Parallel Polynomial Arithmetic
- The Complexity of theA B CProblem
- The word and geodesic problems in free solvable groups
- Elementary Methods in Number Theory
- The Diophantine problem in some metabelian groups
- The Compressed Word Problem for Groups
- Knapsack problems in groups
- On Artin's conjecture.
- Knapsack in hyperbolic groups
This page was built for publication: