Optimal sparsification for some binary CSPs using low-degree polynomials (Q4608634)
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: Optimal sparsification for some binary CSPs using low-degree polynomials |
scientific article; zbMATH DE number 6851904
| 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 6851904 |
Statements
21 March 2018
0 references
constraint satisfaction problem
0 references
sparsification
0 references
satisfiability
0 references
kernelization
0 references
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials (English)
0 references
0.9918952584266664
0 references
0.8596965670585632
0 references
0.8563028573989868
0 references
0.8303884267807007
0 references
0.8213604092597961
0 references
