The Complexity of Modular Graph Automorphism (Q2706110)

From MaRDI portal
Revision as of 12:03, 15 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The Complexity of Modular Graph Automorphism
scientific article

    Statements

    title
    The Complexity of Modular Graph Automorphism (English)
    0 references
    author
    V. Arvind
    0 references
    Richard Beigel
    0 references
    Antoni Lozano
    0 references
    publication date
    19 March 2001
    0 references
    zbMATH Keywords
    graph isomorphism
    0 references
    graph automorphism
    0 references
    decision problems
    0 references
    search problems
    0 references
    IP protocols
    0 references
    program checking
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q15
    0 references
    68W10
    0 references
    68Q25
    0 references
    20B05
    0 references
    zbMATH DE Number
    1578751
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2706110&oldid=3032289"
      Powered by MediaWiki