Complexity versus stability for classes of propositional formulas (Q293437)

From MaRDI portal
Revision as of 09:07, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Complexity versus stability for classes of propositional formulas
scientific article

    Statements

    Complexity versus stability for classes of propositional formulas (English)
    0 references
    0 references
    9 June 2016
    0 references
    computational complexity
    0 references
    coNP-completeness
    0 references
    equivalence of formulas
    0 references
    Horn formulas
    0 references
    2CNF formulas
    0 references
    XOR-CNF formulas
    0 references

    Identifiers

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