Visualizing SAT instances and runs of the DPLL algorithm (Q2462641)

From MaRDI portal
Revision as of 19:05, 18 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Visualizing SAT instances and runs of the DPLL algorithm
scientific article

    Statements

    title
    Visualizing SAT instances and runs of the DPLL algorithm (English)
    0 references
    author
    Carsten Sinz
    0 references
    publication date
    3 December 2007
    0 references
    zbMATH Keywords
    SAT instance
    0 references
    DPLL procedure
    0 references
    describes a project that uses
    Velev SAT Benchmarks
    0 references
    MiniSat
    0 references
    DPvis
    0 references
    Chaff
    0 references
    BerkMin
    0 references
    cites work
    Q3429153
    0 references
    Q3429163
    0 references
    Q4012216
    0 references
    Q3429157
    0 references
    Q4704799
    0 references
    Q4488090
    0 references
    Q4417952
    0 references

    Identifiers

    zbMATH DE Number
    5217106
    0 references
    OpenAlex ID
    W2010166520
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2462641&oldid=39098624"
    Powered by MediaWiki