Abstract
We study the complexity of classical constraint satisfaction problems on a 2D grid. Specifically, we consider the computational complexity of function versions of such problems, with the additional restriction that the constraints are translationally invariant, namely, the variables are located at the vertices of a 2D grid and the constraint between every pair of adjacent variables is the same in each dimension. The only input to the problem is thus the size of the grid. This problem is equivalent to one of the most interesting problems in classical physics, namely, computing the lowest energy of a classical system of particles on the grid. We provide a tight characterization of the complexity of this problem, and show that it is complete for the class FP^NEXP. Gottesman and Irani (FOCS 2009) also studied classical constraint satisfaction problems using this strong notion of translationalinvariance; they show that the problem of deciding whether the cost of the optimal assignment is below a given threshold is NEXPcomplete. Our result is thus a strengthening of their result from the decision version to the function version of the problem. Our result can also be viewed as a generalization to the translationally invariant setting, of Krentel’s famous result from 1988, showing that the function version of SAT is complete for the class FP^NP.
An essential ingredient in the proof is a study of the computational complexity of a gapped variant of the problem. We show that it is NEXPhard to approximate the cost of the optimal assignment to within an additive error of Ω(N^(1/4)), where the grid size is N × N. To the best of our knowledge, no gapped result is known for CSPs on the grid, even in the nontranslationally invariant case. This might be of independent interest. As a byproduct of our results, we also show that a decision version of the optimization problem which asks whether the cost of the optimal assignment is odd or even is also complete for P^NEXP.
BibTeX  Entry
@InProceedings{aharonov_et_al:LIPIcs.CCC.2023.23,
author = {Aharonov, Dorit and Irani, Sandy},
title = {{Translationally Invariant Constraint Optimization Problems}},
booktitle = {38th Computational Complexity Conference (CCC 2023)},
pages = {23:123:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959772822},
ISSN = {18688969},
year = {2023},
volume = {264},
editor = {TaShma, Amnon},
publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18293},
URN = {urn:nbn:de:0030drops182932},
doi = {10.4230/LIPIcs.CCC.2023.23},
annote = {Keywords: Constraint satisfaction, Tiling, Translationalinvariance}
}
Keywords: 

Constraint satisfaction, Tiling, Translationalinvariance 
Collection: 

38th Computational Complexity Conference (CCC 2023) 
Issue Date: 

2023 
Date of publication: 

10.07.2023 