On the parallel complexity of linear groups
From MaRDI portal
Recommendations
- Parallel complexity for nilpotent groups
- scientific article; zbMATH DE number 18644
- scientific article; zbMATH DE number 4145340
- The Parallel Complexity of Abelian Permutation Group Problems
- The Computational Complexity to Evaluate Representations of General Linear Groups
- scientific article; zbMATH DE number 475363
- scientific article; zbMATH DE number 1534404
- Parallel poly-pushdown groups
- Linear groups and computation
- Towards effective algorithms for linear groups.
Cites work
- A taxonomy of problems with fast parallel algorithms
- Complexity, combinatorial group theory and the language of palutators
- Free subgroups in linear groups
- Groups, the theory of ends, and context-free languages
- scientific article; zbMATH DE number 3642708 (Why is no real title available?)
- scientific article; zbMATH DE number 3133601 (Why is no real title available?)
- scientific article; zbMATH DE number 3841223 (Why is no real title available?)
- scientific article; zbMATH DE number 4145340 (Why is no real title available?)
- scientific article; zbMATH DE number 4012495 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3733890 (Why is no real title available?)
- scientific article; zbMATH DE number 3784868 (Why is no real title available?)
- scientific article; zbMATH DE number 3607492 (Why is no real title available?)
- scientific article; zbMATH DE number 3224578 (Why is no real title available?)
- scientific article; zbMATH DE number 3307642 (Why is no real title available?)
- scientific article; zbMATH DE number 3411305 (Why is no real title available?)
- scientific article; zbMATH DE number 3092634 (Why is no real title available?)
- Log Depth Circuits for Division and Related Problems
- Lower bounds on the complexity of real-time branching programs
- On a problem of Philip Hall
- On oblivious branching programs of linear length
- On the complexity of intersection and conjugacy problems in free groups
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Problems complete for deterministic logarithmic space
- Shorter Notes: Representations of Polycyclic Groups
- Subgroups of Finite Index in Free Groups
- 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
- The accessibility of finitely presented groups
- The Nielsen reduction and P-complete problems in free groups
- The Parallel Complexity of Abelian Permutation Group Problems
- Word Problems Solvable in Logspace
Cited in
(11)- Algorithmically complex residually finite groups
- Evaluation of circuits over nilpotent and polycyclic groups
- The large-scale geometry of locally compact solvable groups
- scientific article; zbMATH DE number 4145340 (Why is no real title available?)
- The Parallel Complexity of Abelian Permutation Group Problems
- scientific article; zbMATH DE number 18644 (Why is no real title available?)
- Sylow Subgroups in Parallel
- The Computational Complexity to Evaluate Representations of General Linear Groups
- Parallel identity testing for skew circuits with big powers and applications
- Parallel complexity for nilpotent groups
- Parallel algorithms for power circuits and the word problem of the Baumslag group
This page was built for publication: On the parallel complexity of linear groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3988804)
