scientific article; zbMATH DE number 7378698
From MaRDI portal
Publication:5009587
DOI10.4230/LIPIcs.ESA.2018.28MaRDI QIDQ5009587
Stefan Woltran, Johannes K. Fichte, Markus Hecher, Markus Zisser
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dynamic programmingtreewidthtree decompositionsparameterized algorithmsweighted model countinggeneral purpose computing on graphics processing units
Related Items (3)
Exploiting Database Management Systems and Treewidth for Counting ⋮ Generating random instances of weighted model counting. An empirical analysis with varying primal treewidth ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximate counting: a detailed analysis
- Treewidth. Computations and approximations
- The first collision for full SHA-1
- SAT-based local improvement for finding tree decompositions of small width
- Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs
- Conflict-driven answer set solving: from theory to practice
- Algorithms for propositional model counting
- Same-decision probability: a confidence measure for threshold-based decisions
- Answer set solving with bounded treewidth revisited
- On the hardness of approximate reasoning
- Solving #SAT and MAXSAT by Dynamic Programming
- Laissez-Faire Caching for Parallel #SAT Solving
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Computing treewidth on the GPU
- Expansion-based QBF Solving on Tree Decompositions*
- Implementing Efficient All Solutions SAT Solvers
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Theory and Applications of Satisfiability Testing
This page was built for publication:
