Point-width and max-CSPs

DOI10.5555/3470152.3470158MaRDI QIDQ6654471zbMATH OpenFDO

Authors Clément Carbonnel, Miguel Romero, S. Zivny

Publication date 19 December 2024

Full work available at URL https://doi.org/10.5555/3470152.3470158

Mathematics Subject Classification ID

Hypergraphs (05C65) Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of satisfiability (68R07)

Recommendations

• Point-Width and Max-CSPs
• Beyond Hypertree Width: Decomposition Methods Without Decompositions
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries
• Tractable hypergraph properties for constraint satisfaction and conjunctive queries
• Tractable structures for constraint satisfaction with truth tables

Cited in

(2)

• Point-Width and Max-CSPs
• Treewidth-pliability and PTAS for Max-CSPs

This page was built for publication: Point-width and max-CSPs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6654471)