Q5009587 (Q5009587): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 2 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: countAntom / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Dsharp / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: gmp / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: htd / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CUD@SAT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laissez-Faire Caching for Parallel #SAT Solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expansion-based QBF Solving on Tree Decompositions* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Answer set solving with bounded treewidth revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: DynASP2.5: Dynamic Programming on Tree Decompositions in Action / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT-based local improvement for finding tree decompositions of small width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting: a detailed analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-driven answer set solving: from theory to practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximate reasoning / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first collision for full SHA-1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Efficient All Solutions SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing treewidth on the GPU / rank
 
Normal rank
Property / cites work
 
Property / cites work: Same-decision probability: a confidence measure for threshold-based decisions / rank
 
Normal rank

Latest revision as of 08:50, 26 July 2024

scientific article; zbMATH DE number 7378698
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7378698

    Statements

    0 references
    0 references
    0 references
    0 references
    4 August 2021
    0 references
    0 references
    parameterized algorithms
    0 references
    weighted model counting
    0 references
    general purpose computing on graphics processing units
    0 references
    dynamic programming
    0 references
    tree decompositions
    0 references
    treewidth
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references