Complexity of Infinite-Domain Constraint Satisfaction
From MaRDI portal
Publication:3388253
DOI10.1017/9781107337534zbMath1495.68007OpenAlexW3164767989MaRDI QIDQ3388253
Publication date: 5 May 2021
Full work available at URL: https://doi.org/10.1017/9781107337534
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Applications of universal algebra in computer science (08A70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Ramsey theory (05D10) Applications of model theory (03C98) Categoricity and completeness of theories (03C35) Computational aspects of satisfiability (68R07)
Related Items (13)
Universal Horn Sentences and the Joint Embedding Property ⋮ Homogeneous structures: model theory meets universal algebra. Abstracts from the workshop held January 3--9, 2021 (online meeting) ⋮ When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems ⋮ Local–global property for G-invariant terms ⋮ The smallest hard trees ⋮ \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's ⋮ The lattice of clones of self-dual operations collapsed ⋮ On guarded extensions of MMSNP ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ General lower bounds and improved algorithms for infinite-domain CSPs ⋮ Unnamed Item ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction ⋮ The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
This page was built for publication: Complexity of Infinite-Domain Constraint Satisfaction
