Chapter
Licensed
Unlicensed
Requires Authentication
5 Parallel complexity in group theory
-
Markus Lohrey
Abstract
This chapter gives a survey on the parallel complexity of group theoretic problems. The focus will be on the word problem and related algorithmic problems. No previous knowledge on parallel complexity classes is assumed.
You are currently not able to access this content.
Abstract
This chapter gives a survey on the parallel complexity of group theoretic problems. The focus will be on the word problem and related algorithmic problems. No previous knowledge on parallel complexity classes is assumed.
You are currently not able to access this content.
Chapters in this book
- Frontmatter I
- Contents V
- List of Contributing Authors VII
- 1 Cellular automata over shifts and subshifts: Garden of Eden theorems and surjunctivity 1
- 2 Languages, groups, and equations 63
- 3 Stallings’ automata 95
- 4 Groups with multiple context-free word problems 161
- 5 Parallel complexity in group theory 183
- 6 The word problem for automaton groups 265
- Index 397
Chapters in this book
- Frontmatter I
- Contents V
- List of Contributing Authors VII
- 1 Cellular automata over shifts and subshifts: Garden of Eden theorems and surjunctivity 1
- 2 Languages, groups, and equations 63
- 3 Stallings’ automata 95
- 4 Groups with multiple context-free word problems 161
- 5 Parallel complexity in group theory 183
- 6 The word problem for automaton groups 265
- Index 397
