Best-case and worst-case sparsifiability of Boolean CSPs (Q786033)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Best-case and worst-case sparsifiability of Boolean CSPs |
scientific article; zbMATH DE number 7233374
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.9982004761695862
0 references
0.8563028573989868
0 references
0.8482533693313599
0 references
0.840053141117096
0 references
0.8275769948959351
0 references
