Name
Abstract | ||
|---|---|---|
We study the Constraint Satisfaction Problem CSP(A), where A is first-order definable in (Z;+,1) and contains +. We prove such problems are either in P or NP-complete. |
Year | Venue | DocType |
|---|---|---|
2018 | MFCS | Conference |
Volume | Citations | PageRank |
abs/1807.00985 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Bodirsky | 1 | 644 | 54.63 |
| Barnaby Martin | 2 | 175 | 31.80 |
| Marcello Mamino | 3 | 16 | 5.51 |
| Antoine Mottet | 4 | 20 | 7.45 |