Sum-of-Products with Default Values: Algorithms and Complexity Results (Q5076308): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3624187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bayesian Reasoning and Machine Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractability in constraint satisfaction problems: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction with succinctly specified relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong computational lower bounds via parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bucket elimination: A unifying framework for reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting truth assignments of formulas of bounded tree-width or clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying tree decompositions for reasoning in graphical models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive-query containment and constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model counting for CNF formulas of bounded modular treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving #SAT and MAXSAT by Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for propositional model counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint satisfaction with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model Counting for Formulas of Bounded Clique-Width / rank
 
Normal rank

Revision as of 23:49, 28 July 2024

scientific article; zbMATH DE number 7527533
Language Label Description Also known as
English
Sum-of-Products with Default Values: Algorithms and Complexity Results
scientific article; zbMATH DE number 7527533

    Statements

    Sum-of-Products with Default Values: Algorithms and Complexity Results (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 2022
    0 references
    constraint satisfaction
    0 references
    satisfiability
    0 references
    0 references
    0 references
    0 references

    Identifiers