Year: 2024
Type: conference-paper
Abstract: We present polynomial-time algorithms for approximate counting and sampling solutions to constraint satisfaction problems (CSPs) with atomic constraints within the local lemma regime: \begin{equation*} pD^{2+o_{q}(1)}\lesssim 1.\end{equation*} When the domain size$q$of each variable becomes sufficiently large, this almost matches the known lower bound$pD^{2}\lesssim 1$for approximate counting and sampling solutions to atomic CSPs [1], [2], thus establishing an almost tight sampling Lovasz local lemma for large domain sizes.
Authors: Chunyang Wang, Yitong Yin
Institution: Nanjing University
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4404848117