Did you mean: Small CAPs that reduce to large CAPs.
For relational structures A, B of the same signature, the Promise Constraint Satisfaction Problem PCSP(A,B) asks whether a given input structure maps homomorphically to A or does not even map to B. We are promised that the input satisfies exactly one of these two cases.
Sep 16, 2021
Aug 22, 2022 · Still, to the best of our knowledge, all known tractable (i.e., solvable in polynomial time) PCSPs reduce to tractable CSPs in this way. As ...
Sep 16, 2021 · To the best of our knowledge all known tractable PCSPs reduce to tractable CSPs in this way. However Barto showed that some PCSPs over finite ...
It is shown that if A, B are graphs and PCSP( A, B ) reduces to tractable CSP( C ) for some finite C , then already A or B has tractable CSP.
Sep 16, 2021 · SMALL PCSPS THAT REDUCE TO LARGE CSPS. 3. 2. Preliminaries. We will only define a bare minimum of notions necessary to make sense of this paper ...
All known tractable PCSPs seem to reduce to tractable CSPs in this way. However Barto (2019) showed that some PCSPs over finite structures require solving CSPs ...
It is shown that if A, B are graphs and PCSP(A,B) reduces to tractable CSP(C) for some finite digraph C, then already A or B has a tractableCSP.
If there exists a structure C with homomorphisms $A\to C\to B$, then PCSP(A,B) reduces naturally to CSP(C). To the best of our knowledge all known tractable ...
Bibliographic details on Small PCSPs that reduce to large CSPs.
We give a first example of a PCSP over Boolean structures which reduces to a tractable CSP over a structure of size 3 but not smaller. Further we investigate ...