The descriptive complexity of subgraph isomorphism without numerics (Q5919541)

From MaRDI portal
scientific article; zbMATH DE number 6763515
Language Label Description Also known as
English
The descriptive complexity of subgraph isomorphism without numerics
scientific article; zbMATH DE number 6763515

    Statements

    The descriptive complexity of subgraph isomorphism without numerics (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2019
    0 references
    22 August 2017
    0 references
    0 references
    0 references
    subgraph isomorphism problem
    0 references
    descriptive complexity
    0 references
    encoding-independent computation
    0 references
    first-order logic
    0 references
    quantifier depth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references