On the parallel complexity of linear groups (Q3988804): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On a problem of Philip Hall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subrekursive Komplexität bei Gruppen. I: Gruppen mit vorgeschriebener Komplexität / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subrekursive Komplexität bei Gruppen. II: Der Einbettungssatz von Higman für entscheidbare Gruppen / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nielsen reduction and P-complete problems in free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of intersection and conjugacy problems in free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log Depth Circuits for Division and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation for well-endowed rings and space-bounded probabilistic machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A taxonomy of problems with fast parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems complete for deterministic logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Complexity of Abelian Permutation Group Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The accessibility of finitely presented groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of Finite Index in Free Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5831393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On oblivious branching programs of linear length / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the complexity of real-time branching programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Word Problems Solvable in Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5513066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Groups, the theory of ends, and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4172915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Notes: Representations of Polycyclic Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free subgroups in linear groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, combinatorial group theory and the language of palutators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3921207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3476278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3762226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5676405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3249822 / rank
 
Normal rank

Latest revision as of 15:46, 15 May 2024

scientific article
Language Label Description Also known as
English
On the parallel complexity of linear groups
scientific article

    Statements

    On the parallel complexity of linear groups (English)
    0 references
    0 references
    28 June 1992
    0 references
    word problem for finitely generated linear groups
    0 references
    parallel complexity
    0 references
    polycyclic group
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers