A characterization of approximability for biased CSPs

DOI10.1145/3519935.3520072arXiv2201.04617MaRDI QIDQ6083553

Euiwoong Lee, Suprovat Ghoshal

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.04617

zbMATH Keywords

constraint satisfaction problemsinapproximabilitydensest-\(k\)-subhypergraph

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: A characterization of approximability for biased CSPs