On the parallel complexity of linear groups

DOI10.1051/ita/1991250403231zbMath0789.68074OpenAlexW85552082MaRDI QIDQ3988804

Stephan Waack

Publication date: 28 June 1992

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92396

zbMATH Keywords

parallel complexitypolycyclic groupword problem for finitely generated linear groups

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Algorithmically complex residually finite groups ⋮ Evaluation of circuits over nilpotent and polycyclic groups ⋮ The large-scale geometry of locally compact solvable groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Nielsen reduction and P-complete problems in free groups
• On the complexity of intersection and conjugacy problems in free groups
• Groups, the theory of ends, and context-free languages
• On oblivious branching programs of linear length
• The accessibility of finitely presented groups
• Complexity, combinatorial group theory and the language of palutators
• Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität
• Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen
• On a problem of Philip Hall
• Free subgroups in linear groups
• A taxonomy of problems with fast parallel algorithms
• Parallel computation for well-endowed rings and space-bounded probabilistic machines
• Log Depth Circuits for Division and Related Problems
• Problems complete for deterministic logarithmic space
• The Parallel Complexity of Abelian Permutation Group Problems
• Lower bounds on the complexity of real-time branching programs
• Word Problems Solvable in Logspace
• Shorter Notes: Representations of Polycyclic Groups
• Subgroups of Finite Index in Free Groups