On the limit of branching rules for hard random unsatisfiable 3-SAT (Q1408384)

From MaRDI portal
Revision as of 21:48, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
On the limit of branching rules for hard random unsatisfiable 3-SAT
scientific article

    Statements

    On the limit of branching rules for hard random unsatisfiable 3-SAT (English)
    0 references
    0 references
    0 references
    15 September 2003
    0 references
    Branching heuristics
    0 references
    Davis-Logemann-Loveland procedure
    0 references
    Minimum search tree size
    0 references
    SAT
    0 references

    Identifiers