Tree-Depth and the Formula Complexity of Subgraph Isomorphism (Q5885602)

From MaRDI portal
Revision as of 11:10, 4 December 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7672230
Language Label Description Also known as
English
Tree-Depth and the Formula Complexity of Subgraph Isomorphism
scientific article; zbMATH DE number 7672230

    Statements

    Tree-Depth and the Formula Complexity of Subgraph Isomorphism (English)
    0 references
    0 references
    0 references
    4 April 2023
    0 references
    circuit complexity
    0 references
    subgraph isomorphism
    0 references
    tree-width
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references