Near unanimity constraints have bounded pathwidth duality
From MaRDI portal
Recommendations
Cited in
(16)- Towards a characterization of constant-factor approximable finite-valued CSPs
- The number of clones determined by disjunctions of unary relations
- Deciding absorption in relational structures
- Majority constraints have bounded pathwidth duality
- Majority functions on structures with finite duality
- \(n\)-permutability and linear Datalog implies symmetric Datalog
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- Absorption in universal algebra and CSP
- Algebra and the complexity of digraph CSPs: a survey
- Solving CSPs using weak local consistency
- Robust algorithms with polynomial loss for near-unanimity CSPs
- The smallest hard trees
- Graphs of finite algebras: edges, and connectivity
- A polynomial relational class of binary CSP
- Symmetric linear arc monadic Datalog and gadget reductions
- Symmetric linear arc monadic Datalog and gadget reductions
This page was built for publication: Near unanimity constraints have bounded pathwidth duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986788)