Best-case and worst-case sparsifiability of Boolean CSPs (Q786033)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best-case and worst-case sparsifiability of Boolean CSPs |
scientific article |
Statements
Best-case and worst-case sparsifiability of Boolean CSPs (English)
0 references
12 August 2020
0 references
constraint satisfaction problems
0 references
kernelization
0 references
sparsification
0 references
lower bounds
0 references
0 references
0 references
