scientific article; zbMATH DE number 7561757
From MaRDI portal
Publication:5092480
DOI10.4230/LIPIcs.CCC.2020.29MaRDI QIDQ5092480
Markus Lohrey, Armin Weiß, Laurent Bartholdi, Michael Figelius
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1909.13781
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
word problemstraight-line programsself-similar groupsGrigorchuk's groupnon-solvable groupsThompson's groups\(NC^1\)-hardnessG-programs
Related Items (5)
Parallel algorithms for power circuits and the word problem of the Baumslag group ⋮ Knapsack and the power word problem in solvable Baumslag–Solitar groups ⋮ The word problem for finitary automaton groups ⋮ An automaton group with \textsf{PSPACE}-complete word problem ⋮ Compression techniques in group theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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).
- Leaf languages and string compression
- Iterated monodromy groups of quadratic polynomials. I.
- Coxeter groups are virtually special
- The Ore conjecture.
- Research announcement: The structure of groups with a quasiconvex hierarchy.
- On the Burnside problem for periodic groups
- On Burnside's problem on periodic groups
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- The iterated mod problem
- Embedding theorems for residually finite groups
- The complexity of Grigorchuk groups with application to cryptography
- A uniform approach to define complexity classes
- Introductory notes on Richard Thompson's groups
- Evaluation of circuits over nilpotent and polycyclic groups
- Logspace and logtime leaf languages
- Self-similar groups and their geometry
- Asymptotic aspects of Schreier graphs and Hanoi Towers groups.
- Free subgroups in linear groups
- Groups, Languages and Automata
- Arithmetic Circuits: A survey of recent results and open questions
- The Smallest Grammar Problem
- Finite monoids and the fine structure of NC 1
- Word Problems Solvable in Logspace
- Finite Monoids: From Word to Circuit Evaluation
- Parallel identity testing for skew circuits with big powers and applications
- On balanced versus unbalanced computation trees
- On subgroups of R. Thompson's group $ F$ and other diagram groups
- The co-word problem for the Higman-Thompson group is context-free
- Computational Complexity
- The Compressed Word Problem for Groups
- Querying and Embedding Compressed Texts
- The word problem
- Counting classes: Thresholds, parity, mods, and fewness
This page was built for publication:
