On the generic complexity of the searching graph isomorphism problem (Q889990)

From MaRDI portal
Revision as of 21:35, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the generic complexity of the searching graph isomorphism problem
scientific article

    Statements

    On the generic complexity of the searching graph isomorphism problem (English)
    0 references
    9 November 2015
    0 references
    generic-case complexity
    0 references
    graph isomorphism
    0 references
    searching graph isomorphism problem
    0 references

    Identifiers

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