Best-case and worst-case sparsifiability of Boolean CSPs (Q786033): Difference between revisions
From MaRDI portal
Normalize DOI. |
Changed label, description and/or aliases in en, and other parts |
||
| description / en | description / en | ||
scientific article | scientific article; zbMATH DE number 7233374 | ||
Latest revision as of 14:00, 8 July 2025
scientific article; zbMATH DE number 7233374
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Best-case and worst-case sparsifiability of Boolean CSPs |
scientific article; zbMATH DE number 7233374 |
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
