The query complexity of graph isomorphism: bypassing distribution testing lower bounds (Q5230286)

From MaRDI portal
scientific article; zbMATH DE number 7096993
Language Label Description Also known as
English
The query complexity of graph isomorphism: bypassing distribution testing lower bounds
scientific article; zbMATH DE number 7096993

    Statements

    The query complexity of graph isomorphism: bypassing distribution testing lower bounds (English)
    0 references
    0 references
    0 references
    22 August 2019
    0 references
    graph isomorphism
    0 references
    property testing
    0 references
    query complexity
    0 references
    sampling
    0 references

    Identifiers

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