An overview of parallel SAT solving (Q487635)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An overview of parallel SAT solving
scientific article

    Statements

    title
    An overview of parallel SAT solving (English)
    0 references
    author
    Ruben Martins
    0 references
    Inês Lynce
    0 references
    Vasco M. Manquinho
    0 references
    published in
    Constraints
    0 references
    publication date
    22 January 2015
    0 references
    zbMATH DE Number
    6389799
    0 references
    zbMATH Keywords
    Boolean satisfiability (SAT)
    0 references
    parallel search
    0 references
    describes a project that uses
    BerkMin
    0 references
    DIMACS
    0 references
    PaMira
    0 references
    PaSAT
    0 references
    Lingeling
    0 references
    c-sat
    0 references
    PSATO
    0 references
    Walksat
    0 references
    Chaff
    0 references
    PaMiraXT
    0 references
    PaQuBE
    0 references
    Sat4j
    0 references
    Picoso
    0 references
    SArTagnan
    0 references
    PMiniSAT
    0 references
    NAGSAT
    0 references
    PMSat
    0 references
    QMiraXT
    0 references
    antom
    0 references
    ZetaSAT
    0 references
    MiniSat
    0 references
    ManySAT
    0 references
    GridSAT
    0 references
    Siege
    0 references
    MPI
    0 references
    Plingeling
    0 references
    PicoSAT
    0 references
    PrecoSAT
    0 references
    CryptoMiniSat
    0 references
    SATO
    0 references
    OpenAlex ID
    W2027282006
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q487635&oldid=32739399"
    Powered by MediaWiki