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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C60 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C78 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6225268 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph isomorphism
Property / zbMATH Keywords: graph isomorphism / rank
 
Normal rank
Property / zbMATH Keywords
 
logspace counting classes
Property / zbMATH Keywords: logspace counting classes / rank
 
Normal rank
Property / zbMATH Keywords
 
parallel complexity
Property / zbMATH Keywords: parallel complexity / rank
 
Normal rank

Revision as of 12:05, 29 June 2023

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph isomorphism
    0 references
    logspace counting classes
    0 references
    parallel complexity
    0 references