Complexity of combinations of qualitative constraint satisfaction problems

DOI10.1007/978-3-319-94205-6_18MaRDI QIDQ1799088zbMATH OpenOpenAlexFDO

Authors Manuel Bodirsky, Johannes Greiner

Publication date 18 October 2018

Full work available at URL https://arxiv.org/abs/1801.05965

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07)

Recommendations

• The complexity of constraint satisfaction problems (invited talk)
• The complexity of temporal constraint satisfaction problems
• Model-theoretic methods in combined constraint satisfiability
• Constraint satisfaction tractability from semi-lattice operations on infinite sets
• Asking the Metaquestions in Constraint Tractability

Cited in

(4)

• Tractable combinations of temporal CSPs
• scientific article; zbMATH DE number 7199580 (Why is no real title available?)
• The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation
• The complexity of problems for quantified constraints

This page was built for publication: Complexity of combinations of qualitative constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1799088)