A bottom-up algorithm for solving ♯2SAT (Q3386918)

From MaRDI portal
Revision as of 01:50, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A bottom-up algorithm for solving ♯2SAT
scientific article

    Statements

    title
    A bottom-up algorithm for solving ♯2SAT (English)
    0 references
    publication date
    8 January 2021
    0 references
    Mathematics Subject Classification ID
    68R07
    0 references
    68R10
    0 references
    68W05
    0 references
    zbMATH DE Number
    7291125
    0 references
    zbMATH Keywords
    \#2SAT
    0 references
    counting models
    0 references
    enumerative algorithm
    0 references
    graph decomposition
    0 references
    OpenAlex ID
    W3022611987
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3386918&oldid=32669314"
    Powered by MediaWiki