Jun 11, 2005 · 'The parallel complexity of some constructions in combinatorial group theory (abstract)' published in 'Mathematical Foundations of Computer ...
Higman proved the following remarkable theorem. A finitely generated group G can be embedded in some finitely presented group H if and only if G can be ...
Semantic Scholar extracted view of "The Parallel Complexity of Some Constructions in Combinatorial Group Theory" by S. Waack.
The parallel complexity of some constructions in combinatorial group theory. Author: Stephen Waack. Stephen Waack. View Profile. Authors Info & Claims. MFCS '90 ...
The Parallel Complexity of Some Constructions in Combinatorial Group Theory (Abstract). Author: Stephan WaackAuthors Info & Claims. MFCS '90: Proceedings of ...
In this thesis, we study the parallel complexity of certain problems in algorithmic group theory. These problems are the word problem, the geodesic and ...
Waack, St.. "On the parallel complexity of linear groups." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 25.4 (1991 ...
Abstract. — The parallel complexity of the word problem of finitely generaled (f g.) linear groups over an arbitrary field is investigated.
The Parallel Complexity of Some Constructions in Combinatorial Group Theory · Computer Science, Mathematics. Journal of Information Processing and Cybernetics.
This is a tutorial introduction to the literature on parallel computers and algorithms that is relevant for combinatorial optimization.
Missing: Constructions | Show results with:Constructions