Fast and parallel decomposition of constraint satisfaction problems
type: Item
instance of: scholarly article
title: Fast and parallel decomposition of constraint satisfaction problems
author: Georg Gottlob
author: Cem Okulmus
author: Reinhard Pichler
published in: Constraints
publication date: 2022-09-29T00:00:00Z
Mathematics Subject Classification ID: 68Txx
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 68Pxx
zbMATH DE Number: 7594545
zbMATH Keywords: constraint satisfaction
zbMATH Keywords: hypergraphs
zbMATH Keywords: structural decomposition methods
zbMATH Keywords: parallel computing
describes a project that uses: HyperBench
describes a project that uses: EmptyHeaded
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
full work available at URL: s10601-022-09332-1
OpenAlex ID: W4281718597
cites work: Hypertree width and related hypergraph invariants
cites work: A compressed Generalized Hypertree Decomposition-based solving technique for non-binary Constraint Satisfaction Problems
cites work: Term Rewriting and All That
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: A unified theory of structural tractability for constraint satisfaction problems
cites work: The PACE 2019 Parameterized Algorithms and Computational Experiments Challenge: The Fourth Iteration (Invited Paper)
cites work: Degrees of acyclicity for hypergraphs and relational database schemes
cites work: HyperBench
cites work: A comparison of structural CSP decomposition methods
cites work: Hypertree decompositions and tractable queries
cites work: Generalized hypertree decompositions: NP-hardness and tractable variants
cites work: A backtracking-based algorithm for hypertree decomposition
cites work: Constraint solving via fractional edge covers
cites work: Decomposing constraint satisfaction problems using database techniques
cites work: Communicating sequential processes
cites work: Treewidth. Computations and approximations
cites work: Conjunctive-query containment and constraint satisfaction
cites work: Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Computing Optimal Hypertree Decompositions
cites work: A Theorem on Boolean Matrices
DOI: 10.1007/S10601-022-09332-1
Recommended article: Fast parallel constraint satisfaction
Recommended article: Q3493326
Recommended article: Q5417659
Recommended article: Formula dissection: A parallel algorithm for constraint satisfaction
Recommended article: Coordination Models and Languages
Recommended article: Reproducible efficient parallel SAT solving
Recommended article: Q4859227
Recommended article: A fast parallel SAT-solver -- efficient workload balancing
Recommended article: Q5421814
description: scientific article; zbMATH DE number 7594545