Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint...
Transcript of Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint...
![Page 1: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/1.jpg)
Sparsification of Constraint Satisfaction Problemswith an application to q-Coloring
Astrid Pieterse
Based on papers at MFCS 2016 and IPEC 2017joint work with Bart M. P. Jansen.
February 20, 2018
![Page 2: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/2.jpg)
Introduction
I Find exact algorithms for NP-hard problemsI Exponential timeI Speed-up possible?
I Preprocess the input instanceI Aim to reduce the sizeI Polynomial time
I Many different NP-hard problemsI Logic problems (cnf-sat, nae-sat,. . . )I Graph problems (3-Coloring, Vertex Cover,. . . )I . . .
I Study constraint satisfaction problemsI All problems above can be written as a CSP instance
![Page 3: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/3.jpg)
Introduction
I Find exact algorithms for NP-hard problemsI Exponential timeI Speed-up possible?
I Preprocess the input instanceI Aim to reduce the sizeI Polynomial time
I Many different NP-hard problemsI Logic problems (cnf-sat, nae-sat,. . . )I Graph problems (3-Coloring, Vertex Cover,. . . )I . . .
I Study constraint satisfaction problemsI All problems above can be written as a CSP instance
![Page 4: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/4.jpg)
Introduction
I Find exact algorithms for NP-hard problemsI Exponential timeI Speed-up possible?
I Preprocess the input instanceI Aim to reduce the sizeI Polynomial time
I Many different NP-hard problemsI Logic problems (cnf-sat, nae-sat,. . . )I Graph problems (3-Coloring, Vertex Cover,. . . )I . . .
I Study constraint satisfaction problemsI All problems above can be written as a CSP instance
![Page 5: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/5.jpg)
Introduction
I Find exact algorithms for NP-hard problemsI Exponential timeI Speed-up possible?
I Preprocess the input instanceI Aim to reduce the sizeI Polynomial time
I Many different NP-hard problemsI Logic problems (cnf-sat, nae-sat,. . . )I Graph problems (3-Coloring, Vertex Cover,. . . )I . . .
I Study constraint satisfaction problemsI All problems above can be written as a CSP instance
![Page 6: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/6.jpg)
Constraint Satisfaction Problems
CSP(Γ)
Input A number of constraints over a set of variables V
I Constraint R(x1, ... , xk) applies relationR ⊆ {0, 1}k to x1, ... , xk ∈ V
Question Does there exists an assignment f : V → {0, 1},such that all constraints are satisfied?
Constraint language Γ
I Specifies the type of constraints
I Can only use constraints R(x1, ... , xk) for R ∈ Γ
![Page 7: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/7.jpg)
Example: 3-CNF-SAT
3-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size 3)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Equivalent to CSP(Γ) for Γ = {R0,R1,R2,R3}I Ri represents clauses with i negations
![Page 8: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/8.jpg)
Example: 3-CNF-SAT
3-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size 3)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Equivalent to CSP(Γ) for Γ = {R0,R1,R2,R3}I Ri represents clauses with i negations
![Page 9: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/9.jpg)
Example: 3-CNF-SAT
3-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size 3)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Equivalent to CSP(Γ) for Γ = {R0,R1,R2,R3}I Ri represents clauses with i negations
R0 is chosen such that R0(x , y , z) is equivalent to (x ∨ y ∨ z)
R0 = {0, 1}3 \ {(0, 0, 0)}= {(0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 0), (1, 0, 1), (1, 1, 0), (1, 1, 1)}
![Page 10: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/10.jpg)
Example: 3-CNF-SAT
3-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size 3)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Equivalent to CSP(Γ) for Γ = {R0,R1,R2,R3}I Ri represents clauses with i negations
R1 is chosen such that R1(x , y , z) is equivalent to (¬x ∨ y ∨ z)
R1 = {0, 1}3 \ {(1, 0, 0)}= {(0, 0, 0), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 1), (1, 1, 0), (1, 1, 1)}
![Page 11: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/11.jpg)
Example: 3-CNF-SAT
3-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size 3)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Equivalent to CSP(Γ) for Γ = {R0,R1,R2,R3}I Ri represents clauses with i negations
R2 is chosen such that R2(x , y , z) is equivalent to (¬x ∨ ¬y ∨ z)
R2 = {0, 1}3 \ {(1, 1, 0)}= {(0, 0, 0), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 0), (1, 0, 1), (1, 1, 1)}
![Page 12: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/12.jpg)
Example: 3-CNF-SAT
3-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size 3)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Equivalent to CSP(Γ) for Γ = {R0,R1,R2,R3}I Ri represents clauses with i negations
R3 is chosen such that R3(x , y , z) is equivalent to (¬x ∨ ¬y ∨ ¬z)
R3 = {0, 1}3 \ {(1, 1, 1)}= {(0, 0, 0), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 0), (1, 0, 1), (1, 1, 0)}
![Page 13: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/13.jpg)
Example: 3-CNF-SAT
3-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size 3)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Equivalent to CSP(Γ) for Γ = {R0,R1,R2,R3}I Ri represents clauses with i negations
R0 = {0, 1}3 \ {(0, 0, 0)}R1 = {0, 1}3 \ {(1, 0, 0)}R2 = {0, 1}3 \ {(1, 1, 0)}R3 = {0, 1}3 \ {(1, 1, 1)}
![Page 14: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/14.jpg)
Sparsification
Constraint satisfaction problems are (often) hard
I Preprocess the inputI Reduce the number of constraints
I Find redundant constraints
I Worst-case bound on the number of remaining constraintsI As a function of the number of variables
I Maintaining the answerI Keeping all satisfying assignments?I Not changing satisfiability
I Efficiently!
![Page 15: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/15.jpg)
Sparsification
Constraint satisfaction problems are (often) hard
I Preprocess the inputI Reduce the number of constraints
I Find redundant constraints
I Worst-case bound on the number of remaining constraintsI As a function of the number of variables
I Maintaining the answerI Keeping all satisfying assignments?I Not changing satisfiability
I Efficiently!
![Page 16: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/16.jpg)
Sparsification
Constraint satisfaction problems are (often) hard
I Preprocess the inputI Reduce the number of constraints
I Find redundant constraints
I Worst-case bound on the number of remaining constraintsI As a function of the number of variables
I Maintaining the answerI Keeping all satisfying assignments?I Not changing satisfiability
I Efficiently!
![Page 17: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/17.jpg)
Sparsification
Constraint satisfaction problems are (often) hard
I Preprocess the inputI Reduce the number of constraints
I Find redundant constraints
I Worst-case bound on the number of remaining constraintsI As a function of the number of variables
I Maintaining the answerI Keeping all satisfying assignments?I Not changing satisfiability
I Efficiently!
![Page 18: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/18.jpg)
Sparsification
Constraint satisfaction problems are (often) hard
I Preprocess the inputI Reduce the number of constraints
I Find redundant constraints
I Worst-case bound on the number of remaining constraintsI As a function of the number of variables
I Maintaining the answerI Keeping all satisfying assignments?I Not changing satisfiability
I Efficiently!
![Page 19: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/19.jpg)
An easy sparsification
d-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size d)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Sparsification procedure:Remove duplicate clauses
Size
I n variables (2n possible literals), d literals per clause
I At most O((2n)d) different possible clauses
I O(nd) for d constant
![Page 20: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/20.jpg)
An easy sparsification
d-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size d)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Sparsification procedure:Remove duplicate clauses
Size
I n variables (2n possible literals), d literals per clause
I At most O((2n)d) different possible clauses
I O(nd) for d constant
![Page 21: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/21.jpg)
An easy sparsification
d-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size d)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
Sparsification procedure:Remove duplicate clauses
Size
I n variables (2n possible literals), d literals per clause
I At most O((2n)d) different possible clauses
I O(nd) for d constant
![Page 22: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/22.jpg)
Known results
d-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size d)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
d-nae-sat:F = (x , y , z) ∧ (x ,¬y ,¬w) ∧ ...
![Page 23: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/23.jpg)
Known results
d-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size d)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
d-nae-sat:F = (x , y , z) ∧ (x ,¬y ,¬w) ∧ ...
Sparsification
d-cnf-sat O(nd) no nontrivial sparsification [Dell,van Melkebeek]
d-nae-sat O(nd−1)
I Can prove certain lower bounds
![Page 24: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/24.jpg)
Known results
d-cnf-sat:
F = (x ∨ y ∨ ¬z)︸ ︷︷ ︸clause (size d)
∧(x ∨ ¬y ∨ ¬w) ∧ ...
d-nae-sat:F = (x , y , z) ∧ (x ,¬y ,¬w) ∧ ...
Sparsification
d-cnf-sat O(nd) no nontrivial sparsification [Dell,van Melkebeek]
d-nae-sat O(nd−1)
I Can prove certain lower bounds
![Page 25: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/25.jpg)
Lower bounds
Prove that no “better” sparsification exists?I Needs assumptions, like P 6= NP
I Stronger assumption: NP 6⊆ coNP/poly
Under these assumptions, we can prove bounds of the type
There is no O(nd−ε) size sparsification for d-cnf-sat,for any ε > 0
![Page 26: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/26.jpg)
Lower bounds
Prove that no “better” sparsification exists?I Needs assumptions, like P 6= NP
I Stronger assumption: NP 6⊆ coNP/poly
Under these assumptions, we can prove bounds of the type
There is no O(nd−ε) size sparsification for d-cnf-sat,for any ε > 0
![Page 27: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/27.jpg)
Lower bounds
Prove that no “better” sparsification exists?I Needs assumptions, like P 6= NP
I Stronger assumption: NP 6⊆ coNP/poly
Under these assumptions, we can prove bounds of the type
There is no O(nd−ε) size sparsification for d-cnf-sat,for any ε > 0
![Page 28: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/28.jpg)
Dichotomy theorem for CSPs
Schaefer’s dichotomy theoremDepending on properties of the relations in Γ, CSP(Γ) is
Polynomial-time solvable
2-sat Horn-satdual-Horn-sat xor-sat. . . . . .
or
NP-hard
3-cnf-sat 3-nae-satExact-sat . . .
![Page 29: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/29.jpg)
Sparsification for CSPs: Goal
Find a classification for sparsifiability
Optimal sparsification bound: O(n) constraints
Exact-sat (upcoming), . . . ?
Optimal sparsification bound: O(n2) constraints
. . . ?
...
Optimal sparsification bound: O(nd) constraints
d-cnf-sat, (d + 1)-nae-sat, . . . ?
...
![Page 30: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/30.jpg)
Exact satisfiability
![Page 31: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/31.jpg)
Exact SAT
Input A formula in the following form, consisting ofclauses, each consisting of a number of literals.
(¬x ,¬y)︸ ︷︷ ︸clause
∧(¬y , z) ∧ (x , z)
Question Does there exists a boolean assignment, such thateach clause contains exactly one true literal?
![Page 32: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/32.jpg)
Sparsification for Exact SAT: Example
Example
Let 0 := false, 1 := true
(¬x ,¬y) ∧ (¬y , z) ∧ (x , z)
Satisfied by x = 1, y = 0, z = 0
I (x , z) is always satisfied when the other clauses are
I It is redundant
![Page 33: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/33.jpg)
Sparsification for Exact SAT: Example
Example
Let 0 := false, 1 := true
(¬x ,¬y) ∧ (¬y , z) ∧ (x , z)
Satisfied by x = 1, y = 0, z = 0
(¬x ,¬y) ∧ ( 1 − x) + ( 1 − y ) = 1 x + y = 1(¬y , z) ∧ ⇔ (1− y) + z = 1 ⇔ z − y = 0(x , z) x + z = 1 x + z = 1is satisfied
I (x , z) is always satisfied when the other clauses are
I It is redundant
![Page 34: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/34.jpg)
Sparsification for Exact SAT: Example
Example
Let 0 := false, 1 := true
(¬x ,¬y) ∧ (¬y , z) ∧ (x , z)
Satisfied by x = 1, y = 0, z = 0
(¬x ,¬y) ∧ ( 1 − x) + ( 1 − y ) = 1 x + y = 1(¬y , z) ∧ ⇔ (1− y) + z = 1 ⇔ z − y = 0(x , z) x + z = 1 x + z = 1is satisfied
I (x , z) is always satisfied when the other clauses are
I It is redundant
![Page 35: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/35.jpg)
Sparsification for Exact SAT: Example
Example
Let 0 := false, 1 := true
(¬x ,¬y) ∧ (¬y , z) ∧ (x , z)
Satisfied by x = 1, y = 0, z = 0
(¬x ,¬y) ∧ ( 1 − x) + ( 1 − y ) = 1 x + y = 1(¬y , z) ∧ ⇔ (1− y) + z = 1 ⇔ z − y = 0(x , z) x + z = 1 x + z = 1is satisfied
I (x , z) is always satisfied when the other clauses are
I It is redundant
![Page 36: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/36.jpg)
Sparsification for Exact SAT: Example
Example
Let 0 := false, 1 := true
(¬x ,¬y) ∧ (¬y , z) ∧ (x , z)
Satisfied by x = 1, y = 0, z = 0
(¬x ,¬y) ∧ ( 1 − x) + ( 1 − y ) = 1 x + y = 1(¬y , z) ∧ ⇔ (1− y) + z = 1 ⇔ z − y = 0(x , z) x + z = 1 x + z = 1is satisfied
+
I (x , z) is always satisfied when the other clauses are
I It is redundant
![Page 37: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/37.jpg)
Sparsification for Exact SAT: Example
Example
Let 0 := false, 1 := true
(¬x ,¬y) ∧ (¬y , z) ∧ (x , z)
Satisfied by x = 1, y = 0, z = 0
(¬x ,¬y) ∧ ( 1 − x) + ( 1 − y ) = 1 x + y = 1(¬y , z) ∧ ⇔ (1− y) + z = 1 ⇔ z − y = 0(x , z) x + z = 1 x + z = 1is satisfied
+
I (x , z) is always satisfied when the other clauses are
I It is redundant
![Page 38: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/38.jpg)
Sparsification for Exact SAT
Can we do this in general?
Find redundant constraints by looking at the matrixFind a basis of the row space
![Page 39: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/39.jpg)
Sparsification for Exact SAT
Can we do this in general?
x + y = 1z − y = 0 ⇔x + z = 1
1 1 0 −10 −1 1 01 0 1 −1
·xyz1
=
000
x + y − 1 = 0z − y = 0 ⇔
x + z − 1 = 0
Find redundant constraints by looking at the matrixFind a basis of the row space
![Page 40: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/40.jpg)
Sparsification for Exact SAT
Can we do this in general?
x + y = 1z − y = 0 ⇔x + z = 1
1 1 0 −10 −1 1 01 0 1 −1
·xyz1
=
000
x + y − 1 = 0z − y = 0 ⇔
x + z − 1 = 0
Find redundant constraints by looking at the matrix1 1 0 −10 −1 1 01 0 1 −1
Find a basis of the row space
![Page 41: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/41.jpg)
Sparsification for Exact SAT
Can we do this in general?
x + y = 1z − y = 0 ⇔x + z = 1
1 1 0 −10 −1 1 01 0 1 −1
·xyz1
=
000
x + y − 1 = 0z − y = 0 ⇔
x + z − 1 = 0
Find redundant constraints by looking at the matrix1 1 0 −10 −1 1 01 0 1 −1
Find a basis of the row space1 1 0 −1
0 −1 1 01 0 1 −1
![Page 42: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/42.jpg)
Sparsification for Exact SAT
I Write down linear equation for each constraint
I Problem asks to find 0/1-solution to linear system
I Compute basis of the row space of the matrixI Keep constraints corresponding to rows in the basis
I Remove others
x+y −1 = 0z − y = 0
x+ z−1 = 0... ...
![Page 43: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/43.jpg)
Sparsification for Exact SAT
I Write down linear equation for each constraint
I Problem asks to find 0/1-solution to linear system
I Compute basis of the row space of the matrixI Keep constraints corresponding to rows in the basis
I Remove others
1 1 0 ... −10 −1 1 ... 01 0 1 ... −1...
......
. . ....
·
xyz...1
=
000...0
![Page 44: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/44.jpg)
Sparsification for Exact SAT
I Write down linear equation for each constraint
I Problem asks to find 0/1-solution to linear system
I Compute basis of the row space of the matrixI Keep constraints corresponding to rows in the basis
I Remove others
1 1 0 ... −10 −1 1 ... 01 0 1 ... −1...
......
. . ....
![Page 45: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/45.jpg)
Sparsification for Exact SAT
I Write down linear equation for each constraint
I Problem asks to find 0/1-solution to linear system
I Compute basis of the row space of the matrixI Keep constraints corresponding to rows in the basis
I Remove others
1 1 0 ... −10 −1 1 ... 01 0 1 ... −1...
......
. . ....
![Page 46: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/46.jpg)
Sparsification for Exact SAT
I Write down linear equation for each constraint
I Problem asks to find 0/1-solution to linear system
I Compute basis of the row space of the matrixI Keep constraints corresponding to rows in the basis
I Remove others
Remaining constraints: (x , y) and (¬y , z)
![Page 47: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/47.jpg)
Sparsification for Exact SAT
CorrectnessRemoved clauses are implied by remaining ones
Size
I The matrix has n + 1 columnsI One for each variable plus one for the constant
I Dimension of row space equals dimension of column spaceI Bounded by #columns
I At most n + 1 remaining constraints
![Page 48: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/48.jpg)
Sparsification for Exact SAT
Theorem
There is a polynomial-time algorithm, that given an instance F ofExact-sat, produces instance F ′ of Exact-sat such that
I Any boolean assignment satisfies F ′ if and only if it satisfies F
I The number of clauses in F ′ is O(n)
The set of clauses of F ′ is a subset of those of F
![Page 49: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/49.jpg)
Generalize the Exact-SATsparsification
![Page 50: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/50.jpg)
c-Polynomial Root CSP
Definition
Input A list of polynomial equalities of the formfi (xi1 , ... , xik ) = 0, where fi has degree at most c .
Question Does there exist a 0/1-assignment to the variables,such that all equalities are satisfied?
I Exact-sat is 1-Polynomial Root CSP
![Page 51: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/51.jpg)
c-Polynomial Root CSP
Definition
Input A list of polynomial equalities of the formfi (xi1 , ... , xik ) = 0, where fi has degree at most c .
Question Does there exist a 0/1-assignment to the variables,such that all equalities are satisfied?
I Exact-sat is 1-Polynomial Root CSP
![Page 52: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/52.jpg)
Sparsification for c-Polynomial Root CSP
Find redundant constraints in a similar way as for Exact-sat
I Each constraint is given by a degree-c polynomial
f (x , y , z) = 0
I Find a subset S of relevant equalitiesI Equalities not in S are combinations of those in SI Adapt previous method to higher-degree polynomials!
I Remove redundant constraints
![Page 53: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/53.jpg)
Sparsification for c-Polynomial Root CSP
Find redundant constraints in a similar way as for Exact-sat
I Each constraint is given by a degree-c polynomial
f (x , y , z) = 0
I Find a subset S of relevant equalitiesI Equalities not in S are combinations of those in SI Adapt previous method to higher-degree polynomials!
I Remove redundant constraints
![Page 54: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/54.jpg)
Sparsification for c-Polynomial Root CSP
Find redundant constraints in a similar way as for Exact-sat
I Each constraint is given by a degree-c polynomial
f (x , y , z) = 0
I Find a subset S of relevant equalitiesI Equalities not in S are combinations of those in SI Adapt previous method to higher-degree polynomials!
I Remove redundant constraints
![Page 55: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/55.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
![Page 56: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/56.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
![Page 57: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/57.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
A =
(... ... ... ... ... ... ...... ... ... ... ... ... ...
)xy xz yz x y z 1
![Page 58: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/58.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
A =
(... ... ... ... ... ... ...... ... ... ... ... ... ...
)xy xz yz x y z 1
![Page 59: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/59.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
A =
(1 0 0 0 2 0 3... ... ... ... ... ... ...
)xy xz yz x y z 1
f
![Page 60: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/60.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
A =
(1 0 0 0 2 0 3... ... ... ... ... ... ...
)xy xz yz x y z 1
f
![Page 61: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/61.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
A =
1 0 0 0 2 0 30 0 1 0 1 0 0... ... ... ... ... ... ...
xy xz yz x y z 1
fg
![Page 62: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/62.jpg)
Finding redundant polynomial equalities
Create a matrix AI Column for each multilinear monomial of degree at most c
I Example: degree-2 polynomials over variables x , y , z
I Row for each constraint. Consider the constraintsI f (x , y) = xy + 2y + 3I g(z , y) = zy + y
Find a basis of the row space of A
I Keep corresponding constraints
A =
1 0 0 0 2 0 30 0 1 0 1 0 0... ... ... ... ... ... ...
xy xz yz x y z 1
fg
![Page 63: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/63.jpg)
Sparsification for c-Polynomial Root CSP
CorrectnessSparsified instance satisfiable ⇔ Original instance satisfiable
I Let τ be a satisfying assignment for the sparsified instance
I Suppose fi (xi1 , ... , xik ) = 0 was removed
I Then there exist αj ∈ R such that
fi (τ(xi1), ... , τ(xik )) =∑j∈B
αj · fj(τ(xj1), ... , τ(xjk ))
Since fj(xj1 , ... , xjk ) = 0 was in the sparsified instance
fj(τ(xj1), ... , τ(xjk )) = 0 ∀j ∈ B
Therebyfi (τ(xi1), ... , τ(xik )) = 0
![Page 64: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/64.jpg)
Sparsification for c-Polynomial Root CSP
CorrectnessSparsified instance satisfiable ⇔ Original instance satisfiable
I Let τ be a satisfying assignment for the sparsified instance
I Suppose fi (xi1 , ... , xik ) = 0 was removed
I Then there exist αj ∈ R such that
fi (τ(xi1), ... , τ(xik )) =∑j∈B
αj · fj(τ(xj1), ... , τ(xjk ))
Since fj(xj1 , ... , xjk ) = 0 was in the sparsified instance
fj(τ(xj1), ... , τ(xjk )) = 0 ∀j ∈ B
Therebyfi (τ(xi1), ... , τ(xik )) = 0
![Page 65: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/65.jpg)
Sparsification for c-Polynomial Root CSP
CorrectnessSparsified instance satisfiable ⇔ Original instance satisfiable
I Let τ be a satisfying assignment for the sparsified instance
I Suppose fi (xi1 , ... , xik ) = 0 was removed
I Then there exist αj ∈ R such that
fi (τ(xi1), ... , τ(xik )) =∑j∈B
αj · fj(τ(xj1), ... , τ(xjk ))
Since fj(xj1 , ... , xjk ) = 0 was in the sparsified instance
fj(τ(xj1), ... , τ(xjk )) = 0 ∀j ∈ B
Therebyfi (τ(xi1), ... , τ(xik )) = 0
![Page 66: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/66.jpg)
Sparsification for c-Polynomial Root CSP
Correctness
Sparsified instance satisfiable ⇔ Original instance satisfiable X
SizeNumber of remaining constraints ≤ #columns
I Column for each multilinear monomial of degree ≤ c
I(ni
)multilinear monomials of degree exactly i
I∑c
i=0
(ni
)= O(nc) columns
![Page 67: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/67.jpg)
Sparsification for c-Polynomial Root CSP
Theorem
There is a polynomial-time algorithm, that given an instance F ofc-Polynomial-root CSP, produces instance F ′ ofc-Polynomial-root CSP such that
I Any boolean assignment satisfies F ′ if and only if it satisfies F
I The number of constraints in F ′ is O(nc)
c-Polynomial-root CSP has a O(nc) size sparsification
![Page 68: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/68.jpg)
Relation to earlier results
Problem Special case of Boundd-cnf-sat d -Polynomial-root CSP O(nd)d-nae-sat (d − 1)-Polynomial-root CSP O(nd−1)d-Exact-sat 1-Polynomial-root CSP O(n)
Clause can be replaced by degree-c polynomial equality
I We have seen: d-Exact-sat
I Next: d-nae-sat
![Page 69: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/69.jpg)
(Monotone) d-NAE-SAT
Find polynomial f of degree d − 1 such that
f (x1, ... , xd) = 0⇔ clause (x1, ... , xd) is nae-satisfied
Clause (x1, ... , xd) is nae-satisfied iff
x1 + x2 + ... + xd ∈ {1, 2, ... , d − 1}
Let g(x) := (x − 1) · (x − 2) · · · (x − (d − 1))
I g(x) = 0 for x ∈ {1, 2, ... , d − 1}I g(0) 6= 0 and g(d) 6= 0
g(x1 + x2 + ... + xd) is the required polynomialI Can handle negations as well
I Use (1− xi ) for ¬xi
![Page 70: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/70.jpg)
(Monotone) d-NAE-SAT
Find polynomial f of degree d − 1 such that
f (x1, ... , xd) = 0⇔ clause (x1, ... , xd) is nae-satisfied
Clause (x1, ... , xd) is nae-satisfied iff
x1 + x2 + ... + xd ∈ {1, 2, ... , d − 1}
Let g(x) := (x − 1) · (x − 2) · · · (x − (d − 1))
I g(x) = 0 for x ∈ {1, 2, ... , d − 1}I g(0) 6= 0 and g(d) 6= 0
g(x1 + x2 + ... + xd) is the required polynomialI Can handle negations as well
I Use (1− xi ) for ¬xi
![Page 71: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/71.jpg)
(Monotone) d-NAE-SAT
Find polynomial f of degree d − 1 such that
f (x1, ... , xd) = 0⇔ clause (x1, ... , xd) is nae-satisfied
Clause (x1, ... , xd) is nae-satisfied iff
x1 + x2 + ... + xd ∈ {1, 2, ... , d − 1}
Let g(x) := (x − 1) · (x − 2) · · · (x − (d − 1))
I g(x) = 0 for x ∈ {1, 2, ... , d − 1}I g(0) 6= 0 and g(d) 6= 0
g(x1 + x2 + ... + xd) is the required polynomialI Can handle negations as well
I Use (1− xi ) for ¬xi
![Page 72: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/72.jpg)
(Monotone) d-NAE-SAT
Find polynomial f of degree d − 1 such that
f (x1, ... , xd) = 0⇔ clause (x1, ... , xd) is nae-satisfied
Clause (x1, ... , xd) is nae-satisfied iff
x1 + x2 + ... + xd ∈ {1, 2, ... , d − 1}
Let g(x) := (x − 1) · (x − 2) · · · (x − (d − 1))
I g(x) = 0 for x ∈ {1, 2, ... , d − 1}I g(0) 6= 0 and g(d) 6= 0
g(x1 + x2 + ... + xd) is the required polynomialI Can handle negations as well
I Use (1− xi ) for ¬xi
![Page 73: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/73.jpg)
Generalizations
We can generalize the result for c-Polynomial-root CSP
I Finite fields
I Integers mod m
I . . .
Can we also use polynomial inequalities?
![Page 74: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/74.jpg)
Generalizations
We can generalize the result for c-Polynomial-root CSP
I Finite fields
I Integers mod m
I . . .
Can we also use polynomial inequalities?
![Page 75: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/75.jpg)
Polynomial inequalities
Each constraint given by f (x1, ... , xk) 6= 0
I Can represent cnf-sat, let x , y , z ∈ {0, 1}
(¬x ∨ y ∨ z)⇔ (1− x) + y + z 6= 0
I Degree-1 polynomials can represent d-cnf-sat for any dI Lower bound for d-cnf-sat known
I No O(nd−ε) sparsification for ε > 0
I Polynomial-size sparsification in this case not possible
![Page 76: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/76.jpg)
Polynomial inequalities
Each constraint given by f (x1, ... , xk) 6= 0
I Can represent cnf-sat, let x , y , z ∈ {0, 1}
(¬x ∨ y ∨ z)⇔ (1− x) + y + z 6= 0
I Degree-1 polynomials can represent d-cnf-sat for any dI Lower bound for d-cnf-sat known
I No O(nd−ε) sparsification for ε > 0
I Polynomial-size sparsification in this case not possible
![Page 77: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/77.jpg)
Polynomial inequalities
Each constraint given by f (x1, ... , xk) 6= 0
I Can represent cnf-sat, let x , y , z ∈ {0, 1}
(¬x ∨ y ∨ z)⇔ (1− x) + y + z 6= 0
I Degree-1 polynomials can represent d-cnf-sat for any dI Lower bound for d-cnf-sat known
I No O(nd−ε) sparsification for ε > 0
I Polynomial-size sparsification in this case not possible
![Page 78: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/78.jpg)
Polynomial inequalities
Each constraint given by f (x1, ... , xk) 6= 0
I Can represent cnf-sat, let x , y , z ∈ {0, 1}
(¬x ∨ y ∨ z)⇔ (1− x) + y + z 6= 0
I Degree-1 polynomials can represent d-cnf-sat for any dI Lower bound for d-cnf-sat known
I No O(nd−ε) sparsification for ε > 0
I Polynomial-size sparsification in this case not possible
![Page 79: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/79.jpg)
Polynomial inequalities
Each constraint given by f (x1, ... , xk) 6= 0
I Can represent cnf-sat, let x , y , z ∈ {0, 1}
(¬x ∨ y ∨ z)⇔ (1− x) + y + z 6= 0
I Degree-1 polynomials can represent d-cnf-sat for any dI Lower bound for d-cnf-sat known
I No O(nd−ε) sparsification for ε > 0
I Polynomial-size sparsification in this case not possible
![Page 80: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/80.jpg)
Application to q-Coloring
![Page 81: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/81.jpg)
The q-Coloring problem
Can the vertices of a graph be colored with at most q colors?
I Focus on q = 3
I red, green, blue
Can be seen as a CSP (domain{0, 1, 2})
I Variable for each vertex
I Constraint for each edge
Trivial sparsification O(n2)
I Matching lower bound
![Page 82: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/82.jpg)
The q-Coloring problem
Can the vertices of a graph be colored with at most q colors?
I Focus on q = 3
I red, green, blue
Can be seen as a CSP (domain{0, 1, 2})
I Variable for each vertex
I Constraint for each edge
Trivial sparsification O(n2)
I Matching lower bound
![Page 83: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/83.jpg)
The q-Coloring problem
Can the vertices of a graph be colored with at most q colors?
I Focus on q = 3
I red, green, blue
Can be seen as a CSP (domain{0, 1, 2})
I Variable for each vertex
I Constraint for each edge
Trivial sparsification O(n2)
I Matching lower bound
![Page 84: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/84.jpg)
Another complexity measure
Bound sparsification size by more interesting parameter
I Measures complexity of input graph
I Size of a Vertex Cover
![Page 85: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/85.jpg)
Another complexity measure
Bound sparsification size by more interesting parameter
I Measures complexity of input graph
I Size of a Vertex Cover
z
![Page 86: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/86.jpg)
Another complexity measure
Bound sparsification size by more interesting parameter
I Measures complexity of input graph
I Size of a Vertex Cover
z
Vertex cover
![Page 87: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/87.jpg)
Another complexity measure
Bound sparsification size by more interesting parameter
I Measures complexity of input graph
I Size of a Vertex Cover
z
Vertex cover
Independent set
![Page 88: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/88.jpg)
Another complexity measure
Bound sparsification size by more interesting parameter
I Measures complexity of input graph
I Size of a Vertex Cover
Why Vertex Cover? Alternatives:I Treewidth
I No polynomial bound
I Deletion distance to (disjoint union of) pathsI No polynomial bound [Jansen,Kratsch]
![Page 89: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/89.jpg)
Kernelization
Efficiently reduce the size of an input instance
I Resulting size depends on parameter value
I Provably small
I Provably correct
Kernel for 3-Coloring
Polynomial-time algorithm that, given graph G with vertex coverof size k, outputs G ′ such that
I |G ′| is bounded by f (k)
I G is 3-Colorable if and only if G ′ is 3-Colorable
![Page 90: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/90.jpg)
Kernelization
Efficiently reduce the size of an input instance
I Resulting size depends on parameter value
I Provably small
I Provably correct
Kernel for 3-Coloring
Polynomial-time algorithm that, given graph G with vertex coverof size k, outputs G ′ such that
I |G ′| is bounded by f (k)
I G is 3-Colorable if and only if G ′ is 3-Colorable
![Page 91: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/91.jpg)
Kernel for 3-Coloring
Previous work
Jansen and Kratsch [Inf Comput. 2013] showed that
I 3-Coloring parameterized by VC has a kernel with O(k3)edges and vertices
Using the tools for CSPs, this can be improved!
Theorem
3-Coloring parameterized by Vertex Cover has a kernel with O(k2)edges and vertices
![Page 92: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/92.jpg)
Kernel for 3-Coloring
Previous work
Jansen and Kratsch [Inf Comput. 2013] showed that
I 3-Coloring parameterized by VC has a kernel with O(k3)edges and vertices
Using the tools for CSPs, this can be improved!
Theorem
3-Coloring parameterized by Vertex Cover has a kernel with O(k2)edges and vertices
![Page 93: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/93.jpg)
Simple kernel for 3-Coloring
![Page 94: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/94.jpg)
Kernel for 3-Coloring: first idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vcI Find redundant vertices in is
I Low-degree vertices can always becolored
I They are redundant
I Coloring can be extended to vertex inis iff ≤ 2 colors used in neighborhood
I Consider v and z , note N(z) ⊆ N(v)I z is redundant
z
a
b
c
d
e
x
z
w
v
u
y
![Page 95: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/95.jpg)
Kernel for 3-Coloring: first idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vcI Find redundant vertices in is
I Low-degree vertices can always becolored
I They are redundant
I Coloring can be extended to vertex inis iff ≤ 2 colors used in neighborhood
I Consider v and z , note N(z) ⊆ N(v)I z is redundant
z
a
b
c
d
e
x
z
w
v
u
y
![Page 96: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/96.jpg)
Kernel for 3-Coloring: first idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vcI Find redundant vertices in is
I Low-degree vertices can always becolored
I They are redundant
I Coloring can be extended to vertex inis iff ≤ 2 colors used in neighborhood
I Consider v and z , note N(z) ⊆ N(v)I z is redundant
z
w
ua
b
c
d
e
x
zv
y
![Page 97: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/97.jpg)
Kernel for 3-Coloring: first idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vcI Find redundant vertices in is
I Low-degree vertices can always becolored
I They are redundant
I Coloring can be extended to vertex inis iff ≤ 2 colors used in neighborhood
I Consider v and z , note N(z) ⊆ N(v)I z is redundant
z
w
ua
b
c
d
e
x
zv
y
![Page 98: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/98.jpg)
Kernel for 3-Coloring: first idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vcI Find redundant vertices in is
I Low-degree vertices can always becolored
I They are redundant
I Coloring can be extended to vertex inis iff ≤ 2 colors used in neighborhood
I Consider v and z , note N(z) ⊆ N(v)I z is redundant
z
w
ua
b
c
d
e
x
zv
y
![Page 99: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/99.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from isz
a
b
c
d
e
x
z
w
v
u
y
G ′
![Page 100: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/100.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from isz
a
b
c
d
e
x
z
w
v
u
y
G ′
![Page 101: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/101.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from isz
a
b
c
d
e
x
z
w
v
u
y
G ′
![Page 102: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/102.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from isz
a
b
c
d
e
x
z
w
v
u
y
G ′
![Page 103: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/103.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from isz
a
b
c
d
e
x
z
w
v
u
y
G ′
![Page 104: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/104.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from isz
a
b
c
d
e
x
z
w
v
u
y
G ′
![Page 105: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/105.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from isz
a
b
c
d
e
x
z
w
v
u
y
G ′
![Page 106: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/106.jpg)
Kernel for 3-Coloring
Build the kernel G ′ as follows
I Start with G ′ = GI For each triple v1, v2, v3 ∈ vc
I Check if they have a commonneighbor in is in G
I If so, mark one such neighbor
I Remove all unmarked nodes from is
a
b
c
d
e
v
G ′
x
![Page 107: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/107.jpg)
Kernel for 3-Coloring
Correctness(⇒) Clearly if G is 3-colorable, so is G ′
![Page 108: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/108.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
x
z
w
v
u
y
G
a
b
c
d
e
v
G ′
Is this always possible?
![Page 109: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/109.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
x
z
w
v
u
y
G
a
b
c
d
e
v
G ′
a
b
c
d
e
Is this always possible?
![Page 110: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/110.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
x
z
w
v
y
G
a
b
c
d
e
v
G ′
a
b
c
d
e
u
Is this always possible?
![Page 111: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/111.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
x
z
w
y
G
a
b
c
d
e
v
G ′
a
b
c
d
e
u
v
Is this always possible?
![Page 112: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/112.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
x
z
y
G
a
b
c
d
e
v
G ′
a
b
c
d
e
u
v
w
Is this always possible?
![Page 113: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/113.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
z
y
G
a
b
c
d
e
v
G ′
a
b
c
d
e
u
v
w
x
Is this always possible?
![Page 114: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/114.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
z
G
a
b
c
d
e
v
G ′
a
b
c
d
e
u
v
w
x
y
Is this always possible?
![Page 115: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/115.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
G
a
b
c
d
e
v
G ′
a
b
c
d
e
u
v
w
x
y
z
Is this always possible?
![Page 116: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/116.jpg)
Kernel for 3-Coloring
Correctness(⇐) Suppose G ′ is 3-colorable, we show how to color G
I Each vertex of vc receives the same color as in G ′
I Let v ∈ isI N(v) ⊆ vc is already coloredI Assign v with a color not used in N(v)
z
a
b
c
d
e
G
a
b
c
d
e
v
G ′
a
b
c
d
e
u
v
w
x
y
z
Is this always possible?
![Page 117: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/117.jpg)
Is this always possible?
Yes! Proof: Suppose not
I Coloring of vc cannot be extended to some x
I Pick r , g , b ∈ N(x) with colors red,green,blue
I r ,g ,b have common neighbor x
I Some common neighbor was marked
I G ′ contains vertex y such that r , g , b ∈ N(y)
I Contradiction
a
b
c
d
e
x
v
G
a
b
c
d
e
v
G ′
a
b
c
d
e
![Page 118: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/118.jpg)
Is this always possible?
Yes! Proof: Suppose not
I Coloring of vc cannot be extended to some x
I Pick r , g , b ∈ N(x) with colors red,green,blue
I r ,g ,b have common neighbor x
I Some common neighbor was marked
I G ′ contains vertex y such that r , g , b ∈ N(y)
I Contradiction
a
b
c
d
e
x
v
G
a
b
c
d
e
v
G ′
a
b
c
d
e
×
![Page 119: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/119.jpg)
Is this always possible?
Yes! Proof: Suppose not
I Coloring of vc cannot be extended to some x
I Pick r , g , b ∈ N(x) with colors red,green,blue
I r ,g ,b have common neighbor x
I Some common neighbor was marked
I G ′ contains vertex y such that r , g , b ∈ N(y)
I Contradiction
a
b
c
d
e
x
v
G
a
b
c
d
e
v
G ′
a
b
c
d
e
×
![Page 120: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/120.jpg)
Is this always possible?
Yes! Proof: Suppose not
I Coloring of vc cannot be extended to some x
I Pick r , g , b ∈ N(x) with colors red,green,blue
I r ,g ,b have common neighbor x
I Some common neighbor was marked
I G ′ contains vertex y such that r , g , b ∈ N(y)
I Contradiction
a
b
c
d
e
x
v
G
a
b
c
d
e
v
G ′
a
b
c
d
e
×
![Page 121: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/121.jpg)
Is this always possible?
Yes! Proof: Suppose not
I Coloring of vc cannot be extended to some x
I Pick r , g , b ∈ N(x) with colors red,green,blue
I r ,g ,b have common neighbor x
I Some common neighbor was marked
I G ′ contains vertex y such that r , g , b ∈ N(y)
I Contradiction
e
x
v
G
e
×a
b
c
d
e
v
G ′
yy
a
b
c
d
a
b
c
d
![Page 122: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/122.jpg)
Is this always possible?
Yes! Proof: Suppose not
I Coloring of vc cannot be extended to some x
I Pick r , g , b ∈ N(x) with colors red,green,blue
I r ,g ,b have common neighbor x
I Some common neighbor was marked
I G ′ contains vertex y such that r , g , b ∈ N(y)
I Contradiction
e
x
v
G
e
×a
b
c
d
e
v
G ′
yy
a
b
c
d
a
b
c
d
![Page 123: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/123.jpg)
Is this always possible?
Yes! Proof: Suppose not
I Coloring of vc cannot be extended to some x
I Pick r , g , b ∈ N(x) with colors red,green,blue
I r ,g ,b have common neighbor x
I Some common neighbor was marked
I G ′ contains vertex y such that r , g , b ∈ N(y)
I Contradiction
e
x
v
G
e
×a
b
c
d
e
v
G ′
yy
a
b
c
d
a
b
c
d
×
![Page 124: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/124.jpg)
Kernel for 3-Coloring
SizeNumber of vertices
I vc: Exactly k by definition
I is: At most(k3
)= O(k3)
Number of edges
I Within vc: O(k2)
I Between vc and is: can be improved to O(k3)
![Page 125: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/125.jpg)
Improved kernel for 3-Coloring
![Page 126: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/126.jpg)
Kernel: general idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vc
I Find more redundant verticesI Any coloring of G − u can be
extended to G
I Similarly, find redundant edges
I Improve on previous kernelz
a
b
c
d
e
x
z
w
v
u
y
![Page 127: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/127.jpg)
Kernel: general idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vc
I Find more redundant verticesI Any coloring of G − u can be
extended to G
I Similarly, find redundant edges
I Improve on previous kernelz
a
b
c
d
e
x
z
w
v
u
y
![Page 128: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/128.jpg)
Kernel: general idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vc
I Find more redundant verticesI Any coloring of G − u can be
extended to G
I Similarly, find redundant edges
I Improve on previous kernelz
w
ua
b
c
d
e
x
zv
y
![Page 129: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/129.jpg)
Kernel: general idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vc
I Find more redundant verticesI Any coloring of G − u can be
extended to G
I Similarly, find redundant edges
I Improve on previous kernelz
w
ua
b
c
d
e
x
zv
y
![Page 130: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/130.jpg)
Kernel: general idea
We have graph G , with vertex cover vcThe remaining vertices form independent set is
I is may be large compared to vc
I Find more redundant verticesI Any coloring of G − u can be
extended to G
I Similarly, find redundant edges
I Improve on previous kernelz
w
ua
b
c
d
e
x
zv
y
![Page 131: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/131.jpg)
Kernel: general idea
Vertices in is can be colored independently
I Each vertex in is corresponds to a constraintI Neighborhood does not use all 3 colors
I Gives constraints on the coloring of vcI If some coloring of vc satisfies all constraints, it
can be extended to isI Previously, ensured by marking vertices
a
c
d
e
v
Alternatively:
For all S ⊆ N(v) with |S | = 3, some color is used twice for S
m
coloring can be extended to v
![Page 132: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/132.jpg)
Kernel: general idea
Vertices in is can be colored independently
I Each vertex in is corresponds to a constraintI Neighborhood does not use all 3 colors
I Gives constraints on the coloring of vcI If some coloring of vc satisfies all constraints, it
can be extended to isI Previously, ensured by marking vertices
a
c
d
e
v
Alternatively:
For all S ⊆ N(v) with |S | = 3, some color is used twice for S
m
coloring can be extended to v
![Page 133: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/133.jpg)
Kernel: general idea
Vertices in is can be colored independently
I Each vertex in is corresponds to a constraintI Neighborhood does not use all 3 colors
I Gives constraints on the coloring of vcI If some coloring of vc satisfies all constraints, it
can be extended to isI Previously, ensured by marking vertices
a
c
d
e
v
Alternatively:
For all S ⊆ N(v) with |S | = 3, some color is used twice for S
m
coloring can be extended to v
![Page 134: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/134.jpg)
Kernel: general idea
Vertices in is can be colored independently
I Each vertex in is corresponds to a constraintI Neighborhood does not use all 3 colors
I Gives constraints on the coloring of vcI If some coloring of vc satisfies all constraints, it
can be extended to isI Previously, ensured by marking vertices
a
c
d
e
v
Alternatively:
For all S ⊆ N(v) with |S | = 3, some color is used twice for S
m
coloring can be extended to v
![Page 135: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/135.jpg)
Kernel: general idea
Vertices in is can be colored independently
I Each vertex in is corresponds to a constraintI Neighborhood does not use all 3 colors
I Gives constraints on the coloring of vcI If some coloring of vc satisfies all constraints, it
can be extended to isI Previously, ensured by marking vertices
a
c
d
e
v
Alternatively:
For all S ⊆ N(v) with |S | = 3, some color is used twice for S
m
coloring can be extended to v
![Page 136: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/136.jpg)
Kernel: general idea
Vertices in is can be colored independently
I Each vertex in is corresponds to a constraintI Neighborhood does not use all 3 colors
I Gives constraints on the coloring of vcI If some coloring of vc satisfies all constraints, it
can be extended to isI Previously, ensured by marking vertices
a
c
d
e
v
Alternatively:
For all S ⊆ N(v) with |S | = 3, some color is used twice for S
m
coloring can be extended to v
![Page 137: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/137.jpg)
Finding redundant verticesusing constraints
![Page 138: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/138.jpg)
Finding redundant constraints
If constraints are given by degree-c polynomial equalitiesI We have seen a sparsification!
I c-Polynomial root CSP on k variables
I There are at most O(kc) relevant constraints
![Page 139: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/139.jpg)
Modeling vertices as constraints
Polynomial equalitiesI Create 3 boolean variables for each vertex in vc.
I a a a ∈ {0, 1} indicate the color of a
I For each vertex v in is, S ⊆ N(v) with |S | = 3I Constraint: S does not use all 3 colors.
Which polynomial to use?
I Needs to have degree ≤ 2
a
c
d
e
v
![Page 140: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/140.jpg)
Modeling vertices as constraints
Polynomial equalitiesI Create 3 boolean variables for each vertex in vc.
I a a a ∈ {0, 1} indicate the color of a
I For each vertex v in is, S ⊆ N(v) with |S | = 3I Constraint: S does not use all 3 colors.
Which polynomial to use?
I Needs to have degree ≤ 2
a
c
d
e
v
![Page 141: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/141.jpg)
Polynomial equalities for 3-Coloring
I 3 variables for each vertex in vc a a a
Let v ∈ is, for each S ⊆ N(v) : |S | = 3I Polynomial equality of degree 2
I For S = {a, d , e}:
a ∧ d + a ∧ e + d ∧ e +
a ∧ + ∧ + ∧d a e d e
∧ + ∧ + ∧a d a e d e +
≡2 1
I Expresses: a,d , and e do not use all 3 colorsI Three equal colors gives 3 ≡2 1I Two equal colors gives 1I Three different colors gives 0
a
b
c
d
e
v
![Page 142: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/142.jpg)
Polynomial equalities for 3-Coloring
I 3 variables for each vertex in vc a a a
Let v ∈ is, for each S ⊆ N(v) : |S | = 3I Polynomial equality of degree 2
I For S = {a, d , e}:
a ∧ d + a ∧ e + d ∧ e +
a ∧ + ∧ + ∧d a e d e
∧ + ∧ + ∧a d a e d e +
≡2 1
I Expresses: a,d , and e do not use all 3 colorsI Three equal colors gives 3 ≡2 1I Two equal colors gives 1I Three different colors gives 0
a
b
c
d
e
v
![Page 143: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/143.jpg)
Polynomial equalities for 3-Coloring
I 3 variables for each vertex in vc a a a
Let v ∈ is, for each S ⊆ N(v) : |S | = 3I Polynomial equality of degree 2
I For S = {a, d , e}:
a ∧ d + a ∧ e + d ∧ e +
a ∧ + ∧ + ∧d a e d e
∧ + ∧ + ∧a d a e d e +
≡2 1
I Expresses: a,d , and e do not use all 3 colorsI Three equal colors gives 3 ≡2 1I Two equal colors gives 1I Three different colors gives 0
a
b
c
d
e
v
![Page 144: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/144.jpg)
Polynomial equalities for 3-Coloring
I 3 variables for each vertex in vc a a a
Let v ∈ is, for each S ⊆ N(v) : |S | = 3I Polynomial equality of degree 2
I For S = {a, d , e}:
a ∧ d + a ∧ e + d ∧ e +
a ∧ + ∧ + ∧d a e d e
∧ + ∧ + ∧a d a e d e +
≡2 1
I Expresses: a,d , and e do not use all 3 colorsI Three equal colors gives 3 ≡2 1I Two equal colors gives 1I Three different colors gives 0
a
b
c
d
e
v
![Page 145: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/145.jpg)
Kernel for 3-Coloring
I Model vertices in is by constraintsI Use Theorem to find subset of relevant constraintsI Keep only vertices and edges used for relevant constraints
z
a
b
c
d
e
x
z
w
v
u
u,w : ∅v :C (a, c , d)C (a, d , e)C (c , d , e)C (a, c , e)x :C (a, c , d)y :C (a, c , e)z :C (c , d , e)
y
![Page 146: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/146.jpg)
Kernel for 3-Coloring
I Model vertices in is by constraintsI Use Theorem to find subset of relevant constraintsI Keep only vertices and edges used for relevant constraints
z
a
b
c
d
e
x
z
w
v
u
u,w : ∅v :C (a, c , d)C (a, d , e)C (c , d , e)C (a, c , e)x :C (a, c , d)y :C (a, c , e)z :C (c , d , e)
y
![Page 147: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/147.jpg)
Kernel for 3-Coloring
I Model vertices in is by constraintsI Use Theorem to find subset of relevant constraintsI Keep only vertices and edges used for relevant constraints
z
a
b
c
d
e
x
z
w
v
u
u,w : ∅v :C (a, c , d)C (a, d , e)C (c , d , e)C (a, c , e)x :C (a, c , d)y :C (a, c , e)z :C (c , d , e)
y
![Page 148: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/148.jpg)
Kernel for 3-Coloring
I Model vertices in is by constraintsI Use Theorem to find subset of relevant constraintsI Keep only vertices and edges used for relevant constraints
z
a
b
c
d
e
x
z
w
v
u
u,w : ∅v :C (a, c , d)C (a, d , e)C (c , d , e)C (a, c , e)x :C (a, c , d)y :C (a, c , e)z :C (c , d , e)
y
![Page 149: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/149.jpg)
Kernel for 3-Coloring
I Model vertices in is by constraintsI Use Theorem to find subset of relevant constraintsI Keep only vertices and edges used for relevant constraints
w
ua
b
c
d
e
x
zv
u,w : ∅v :C (a, c , d)C (a, d , e)C (c , d , e)C (a, c , e)x :C (a, c , d)y :C (a, c , e)z :C (c , d , e)
y
![Page 150: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/150.jpg)
Kernel for 3-Coloring
I Model vertices in is by constraintsI Use Theorem to find subset of relevant constraintsI Keep only vertices and edges used for relevant constraints
z
w
ua
b
c
d
e
x
v
u,w : ∅v :C (a, c , d)C (a, d , e)C (c , d , e)C (a, c , e)x :C (a, c , d)y :C (a, c , e)z :C (c , d , e)
y
![Page 151: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/151.jpg)
Kernel for 3-Coloring
I Model vertices in is by constraintsI Use Theorem to find subset of relevant constraintsI Keep only vertices and edges used for relevant constraints
z
w
ua
b
c
d
e
x
v
u,w : ∅v :C (a, c , d)C (a, d , e)C (c , d , e)C (a, c , e)x :C (a, c , d)y :C (a, c , e)z :C (c , d , e)
y
![Page 152: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/152.jpg)
Kernel size
I Number of constraints O(#varsdegree)I 3 · k variablesI degree 2
I Number of constraints O((3k)2)
I Constraint corresponds to ≤ 1 vertex and ≤ 3 edges
I O(k2) vertices and edges
Theorem
There exists a polynomial-time algorithm that when given graph Gwith vertex cover S of size k , outputs graph G ′ such that
I G ′ is 3-Colorable if and only if G is 3-Colorable, and
I G ′ has O(k2) vertices and edges.
![Page 153: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/153.jpg)
q-Coloring
Coloring with q colors
Theorem
q-Coloring parameterized by Vertex Cover has a kernel withO(kq−1) vertices and edges.
Can we do better?
Theorem
q-Coloring parameterized by Vertex Cover has no kernel of bitsizeO(kq−1−ε), unless NP ⊆ coNP/poly.
![Page 154: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/154.jpg)
q-Coloring
Coloring with q colors
Theorem
q-Coloring parameterized by Vertex Cover has a kernel withO(kq−1) vertices and edges.
Can we do better?
Theorem
q-Coloring parameterized by Vertex Cover has no kernel of bitsizeO(kq−1−ε), unless NP ⊆ coNP/poly.
![Page 155: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/155.jpg)
Conclusion
SummaryI Sparsification upper and lower bounds for a number of CSPs
I Using low-degree polynomial equalities
I Application to q-Coloring parameterized by Vertex CoverI Kernel with O(kq−1) vertices and edges
Open problemsI Full classification of sparsifiability of CSPs
I Non-boolean domain?
I Sparsifiability of H-ColoringI How is this influenced by the graph structure?
Thank you!
![Page 156: Sparsification of Constraint Satisfaction Problems with an ... · Sparsi cation of Constraint Satisfaction Problems with an application to q-Coloring Astrid Pieterse Based on papers](https://reader035.fdocuments.in/reader035/viewer/2022071218/605398be61fbca19342f5644/html5/thumbnails/156.jpg)
Conclusion
SummaryI Sparsification upper and lower bounds for a number of CSPs
I Using low-degree polynomial equalities
I Application to q-Coloring parameterized by Vertex CoverI Kernel with O(kq−1) vertices and edges
Open problemsI Full classification of sparsifiability of CSPs
I Non-boolean domain?
I Sparsifiability of H-ColoringI How is this influenced by the graph structure?
Thank you!