Dice Question Streamline Icon: https://streamlinehq.com

Complexity classification for valued non-promise CSPs with fixed threshold

Classify the computational complexity of valued non-promise CSPs with fixed threshold, establishing a complete tractability–hardness boundary within the valued PCSP framework.

Information Square Streamline Icon: https://streamlinehq.com

Background

As a concrete subfamily, valued non-promise CSPs with fixed thresholds could admit a full complexity classification. The authors highlight this as an especially interesting case among the broader open questions.

Resolving this would provide a benchmark for the valued framework and potentially guide techniques applicable to more general valued PCSPs.

References

There are however many basic questions and theory-building tasks left open already for finite-domain valued PCSPs: to incorporate the trivial reduction as in e.g. \cref{ex:crips-vs-valued}; to characterize gadget reductions (or versions of definability) in terms of polymorphisms or plurimorphisms; to characterize plurimorphism valued minions of templates; to clarify whether plurimorphisms are necessary to determine computational complexity or enough information is provided already by polymorphisms; to develop methods for proving nonexistence of homomorphisms; to revisit the valued CSP dichotomy without fixed threshold and Raghavendra's result on unique games hardness of approximation for all MaxCSPs; among others. An interesting special case for a full complexity classification is the valued non-promise CSPs with fixed threshold.

— The Rise of Plurimorphisms: Algebraic Approach to Approximation (2401.15186 - Barto et al., 26 Jan 2024) in Conclusion