Name
Abstract | ||
|---|---|---|
Constraint satisfaction problems for first-order reducts of finitely bounded homogeneous structures form a large class of computational problems that might exhibit a complexity dichotomy, P versus NP-complete. A powerful method to obtain polynomial-time tractability results for such CSPs is a certain reduction to polynomial-time tractable finite-domain CSPs de-fined over k-types, for a sufficientl... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/LICS52264.2021.9470683 | 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) |
Keywords | DocType | ISBN |
Computer science,Sufficient conditions,Interpolation,Cognition,Complexity theory | Conference | 978-1-6654-4895-6 |
Citations | PageRank | References |
1 | 0.35 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manuel Bodirsky | 1 | 644 | 54.63 |
| Bertalan Bodor | 2 | 1 | 0.35 |