scientific article; zbMATH DE number 6109829
From MaRDI portal
Publication:4649542
DOI10.4230/LIPIcs.CSL.2012.122zbMath1252.03087MaRDI QIDQ4649542
Publication date: 22 November 2012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexityRamsey theorymodel theorytemporal reasoningconstraint satisfaction problemsuniversal algebra
Analysis of algorithms and problem complexity (68Q25) Ramsey theory (05D10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Temporal logic (03B44) Equational classes, universal algebra in model theory (03C05) Model theory of denumerable and separable structures (03C15)
Related Items
The Complexity of Valued CSPs ⋮ Qualitative constraint satisfaction problems: an extended framework with landmarks ⋮ Constants and finite unary relations in qualitative constraint reasoning ⋮ Unnamed Item ⋮ Constraint Satisfaction Problems for Reducts of Homogeneous Graphs ⋮ A Dichotomy for First-Order Reducts of Unary Structures ⋮ Unnamed Item ⋮ Unnamed Item