The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396)

From MaRDI portal
Revision as of 11:28, 10 June 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
The complexity of homomorphisms and renamings for minimal unsatisfiable formulas
scientific article

    Statements

    The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (English)
    0 references
    0 references
    0 references
    13 May 2005
    0 references
    0 references
    complexity
    0 references
    renaming
    0 references
    homomorphism
    0 references
    minimal unsatisfiable formula
    0 references
    graph isomorphism
    0 references
    0 references