The descriptive complexity of subgraph isomorphism without numerics (Q5919541)

From MaRDI portal
Revision as of 11:44, 12 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7076772
Language Label Description Also known as
English
The descriptive complexity of subgraph isomorphism without numerics
scientific article; zbMATH DE number 7076772

    Statements

    The descriptive complexity of subgraph isomorphism without numerics (English)
    0 references
    0 references
    0 references
    4 July 2019
    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