Optimal polynomial-time compression for Boolean Max CSP (Q5874535)
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 polynomial-time compression for Boolean Max CSP |
scientific article; zbMATH DE number 7651202
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal polynomial-time compression for Boolean Max CSP |
scientific article; zbMATH DE number 7651202 |
Statements
7 February 2023
0 references
constraint satisfaction problem
0 references
kernelization
0 references
exponential time algorithms
0 references
0 references
0 references
0 references
0.8433348536491394
0 references
0.8328725099563599
0 references
0.8048650026321411
0 references
0.80402672290802
0 references
