Algebraic approach to promise constraint satisfaction — mentioned by cevi

Fri, 08 Dec 2023 13:46:35 GMT

At first, the results claimed here seem to clash with the fact that we know, for instance, that it is NP-hard to 5-color a graph which is promised to be 3-colorable [1]. Of course, the devil is in the details - on page 11, where they describe the "LOCAL" computation model they work in, they explain: "In each round the processors may perform unbounded computations on their respective local state variables and subsequently exchange of messages of arbitrary size along the links given by the underlying input graph." Given this setup, it should be possible to solve any problem in O(n) rounds, and…

Paper and discussion history. A mention is not an endorsement.

Algebraic approach to promise constraint satisfaction · HackerPapers discussions

Algebraic approach to promise constraint satisfaction — mentioned by cevi