Recognizing disguised NR(1) instances of the satisfiability problem (Q3898029)

From MaRDI portal
Revision as of 23:33, 20 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q55952578, #quickstatements; #temporary_batch_1710972793655)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Recognizing disguised NR(1) instances of the satisfiability problem
scientific article

    Statements

    Recognizing disguised NR(1) instances of the satisfiability problem (English)
    0 references
    0 references
    1980
    0 references
    satisfiability problem
    0 references
    Horn set
    0 references
    negation restricted
    0 references
    Boolean expressions
    0 references
    conjunctive normal form
    0 references
    constructive linear-time algorithm
    0 references

    Identifiers