Pages that link to "Item:Q3578192"
From MaRDI portal
The following pages link to The complexity of temporal constraint satisfaction problems (Q3578192):
Displayed 43 items.
- Distance constraint satisfaction problems (Q259047) (← links)
- Constraint satisfaction and semilinear expansions of addition over the rationals and the reals (Q269512) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Reducts of the random partial order (Q462283) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- The wonderland of reflections (Q1709740) (← links)
- Constants and finite unary relations in qualitative constraint reasoning (Q1749385) (← links)
- Permutation groups with small orbit growth (Q2037519) (← links)
- An algebraic view on p-admissible concrete domains for lightweight description logics (Q2055793) (← links)
- Computational complexity of hybrid interval temporal logics (Q2084954) (← links)
- Using model theory to find decidable and tractable description logics with concrete domains (Q2090131) (← links)
- On a stronger reconstruction notion for monoids and clones (Q2121508) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Reconstructing the topology of clones (Q2960444) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- Constraint Satisfaction Problems over the Integers with Successor (Q3448790) (← links)
- A Dichotomy for First-Order Reducts of Unary Structures (Q4643958) (← links)
- (Q4643959) (← links)
- Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures (Q4973030) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- Quantified Constraints in Twenty Seventeen (Q4993605) (← links)
- (Q5002800) (← links)
- (Q5005133) (← links)
- When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems (Q5067445) (← links)
- (Q5089260) (← links)
- (Q5094139) (← links)
- (Q5109509) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- 𝜔-categorical structures avoiding height 1 identities (Q5141754) (← links)
- Tractability of quantified temporal constraints to the max (Q5175605) (← links)
- Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems) (Q5222129) (← links)
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs (Q5232325) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom (Q5870532) (← links)
- \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's (Q6111953) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)
- Erdős-Szekeres theorem for multidimensional arrays (Q6172693) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)