Optimal sparsification for some binary CSPs using low-degree polynomials (Q5205824)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7143744
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal sparsification for some binary CSPs using low-degree polynomials |
scientific article; zbMATH DE number 7143744 |
Statements
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (English)
0 references
16 December 2019
0 references
constraint satisfaction problem
0 references
kernelization
0 references
satisfiability
0 references
sparsification
0 references
0.9918952584266664
0 references
0.8526600003242493
0 references
0.8482533693313599
0 references
0.8262515068054199
0 references
0.820345401763916
0 references
