On the complexity of choosing the branching literal in DPLL (Q1978252)

From MaRDI portal
Revision as of 11:11, 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
On the complexity of choosing the branching literal in DPLL
scientific article

    Statements

    On the complexity of choosing the branching literal in DPLL (English)
    0 references
    0 references
    4 June 2000
    0 references
    Davis-Putnam
    0 references
    complexity
    0 references
    propositional satisfiability
    0 references

    Identifiers