Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047)

From MaRDI portal
Revision as of 00:32, 5 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Counting truth assignments of formulas of bounded tree-width or clique-width
scientific article

    Statements

    Counting truth assignments of formulas of bounded tree-width or clique-width (English)
    0 references
    0 references
    0 references
    0 references
    26 February 2008
    0 references
    satisfiability (SAT)
    0 references
    counting problems
    0 references
    fixed parameter tractable (FPT)
    0 references
    tree-width
    0 references
    clique-width
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references