Fast and parallel decomposition of constraint satisfaction problems
From MaRDI portal
Publication:2079275
DOI10.1007/S10601-022-09332-1OpenAlexW4281718597MaRDI QIDQ2079275FDOQ2079275
Reinhard Pichler, Georg Gottlob, Cem Okulmus
Publication date: 29 September 2022
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-022-09332-1
Cites Work
- Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Theorem on Boolean Matrices
- Decomposing constraint satisfaction problems using database techniques
- A comparison of structural CSP decomposition methods
- Conjunctive-query containment and constraint satisfaction
- Hypertree width and related hypergraph invariants
- Generalized hypertree decompositions: NP-hardness and tractable variants
- Constraint solving via fractional edge covers
- Graph minors. II. Algorithmic aspects of tree-width
- Hypertree decompositions and tractable queries
- A unified theory of structural tractability for constraint satisfaction problems
- Treewidth. Computations and approximations
- Communicating sequential processes
- Term Rewriting and All That
- Degrees of acyclicity for hypergraphs and relational database schemes
- A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems
- Computing Optimal Hypertree Decompositions
- HyperBench
- A backtracking-based algorithm for hypertree decomposition
- The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
Cited In (7)
- Recent Advances in Constraints
- Parallelizing SMT solving: lazy decomposition and conciliation
- Fast reductions from RAMs to delegatable succinct constraint satisfaction problems
- A tagging method for parallel constraint satisfaction
- Fast parallel hypertree decompositions in logarithmic recursion depth
- Computing optimal hypertree decompositions with SAT
- Title not available (Why is that?)
Uses Software
Recommendations
- A fast parallel SAT-solver -- efficient workload balancing 👍 👎
- Reproducible efficient parallel SAT solving 👍 👎
- Coordination Models and Languages 👍 👎
- Formula dissection: A parallel algorithm for constraint satisfaction 👍 👎
- Fast parallel constraint satisfaction 👍 👎
- Fast parallel constraint satisfaction 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Fast and parallel decomposition of constraint satisfaction problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079275)
