3 papers
cs.CC2026
Constant-factor approximation of MinCostCSP with a conservative majority polymorphism
Marcin Kozik, Stanislav Živný
For a relational structure A, the Minimum Cost Constraint Satisfaction Problem is the following problem denoted by MinCostCSP(A): Given an instance of CSP(A) with rational costs on…
cs.DM2025
Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
Tamio-Vesa Nakajima, Zephyr Verwimp, Marcin Wrochna +1
Using the algebraic approach to promise constraint satisfaction problems, we establish complexity classifications of three natural variants of hypergraph colourings: standard nonmo…
cs.DS2024
Maximum And- vs. Even-SAT
Tamio-Vesa Nakajima, Stanislav Živný
A multiset of literals, called a clause, is \emph{strongly satisfied} by an assignment if \emph{no} literal evaluates to false. Finding an assignment that maximises the number of s…