Solving partial constraint satisfaction problems with tree decomposition (Q4785233)

From MaRDI portal
Revision as of 02:42, 10 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1847197
Language Label Description Also known as
English
Solving partial constraint satisfaction problems with tree decomposition
scientific article; zbMATH DE number 1847197

    Statements

    Solving partial constraint satisfaction problems with tree decomposition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2002
    0 references
    tree decomposition
    0 references
    partial constraint
    0 references
    satisfaction
    0 references
    frequency assignment
    0 references
    MAX-SAT
    0 references
    dynamic programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references