Computational complexity of computing a partial solution for the graph automorphism problems (Q1019184)

From MaRDI portal
Revision as of 15:02, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of computing a partial solution for the graph automorphism problems
scientific article

    Statements

    Computational complexity of computing a partial solution for the graph automorphism problems (English)
    0 references
    0 references
    0 references
    28 May 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    reducibility
    0 references
    graph automorphism
    0 references
    partial solution
    0 references
    0 references