The parallel complexity of graph canonization under abelian group action (Q378219): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5465356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships among $PL$, $\#L$, and the determinant / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of matrix rank and feasible systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hypergraph and Graph Isomorphism with Bounded Color Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACS 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism and canonization of tournaments and hypertournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure and importance of logspace-MOD class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4364501 / 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: Q3912839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completeness results for graph isomorphism. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for solvable permutation groups / 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: Parallel Tree Contraction Part 2: Further Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank

Latest revision as of 00:39, 7 July 2024

scientific article
Language Label Description Also known as
English
The parallel complexity of graph canonization under abelian group action
scientific article

    Statements

    The parallel complexity of graph canonization under abelian group action (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2013
    0 references
    graph isomorphism
    0 references
    logspace counting classes
    0 references
    parallel complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references