scientific article; zbMATH DE number 7378360
From MaRDI portal
Publication:5005145
DOI10.4230/LIPIcs.MFCS.2018.43MaRDI QIDQ5005145
Peter Jonsson, Victor Lagerkvist
Publication date: 4 August 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning ⋮ Computational Short Cuts in Infinite Domain Constraint Satisfaction
Cites Work
- Maintaining knowledge about temporal intervals
- Strong partial clones and the time complexity of SAT problems
- An initial study of time complexity in infinite-domain constraint satisfaction
- On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus
- Relation algebras and their application in temporal and spatial reasoning
- Datalog and constraint satisfaction with infinite templates
- On the Limits of Sparsification
- A Model-Theoretic View on Qualitative Constraint Reasoning
- Subexponential Algorithms for Unique Games and Related Problems
- Reasoning about temporal relations
- The Time Complexity of Constraint Satisfaction
- Total Ordering Problem
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Parameterized complexity: exponential speed-up for planar graph problems
- On the Subexponential-Time Complexity of CSP
- On the complexity of \(k\)-SAT
This page was built for publication:
