Satisfiability of ordering CSPs above average is fixed-parameter tractable

DOI10.1109/FOCS.2015.64MaRDI QIDQ6946846zbMATH OpenFDO

Authors Konstantin Makarychev, Yuan Zhou, Yury Makarychev

Publication date 5 August 2025

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx) Theory of computing (68Qxx)

This page was built for publication: Satisfiability of ordering CSPs above average is fixed-parameter tractable

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