Conservative CSPs in Logspace are in Symmetric Linear Datalog (under complexity theoretic assumptions)
Year: 2026
Type: preprint
Abstract: We show that the constraint satisfaction problem of any finite conservative structure that can not pp-construct st-Con (whose CSP is NL-complete) or 3Lin2 (whose CSP is Mod2L-complete) is solved by a symmetric linear Datalog program and therefore in L.
Source: arXiv (Cornell University)
Author: Starke, Florian
Institution: Technische Universität Dresden
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7214756571