scientific article; zbMATH DE number 7199580

MaRDI QIDQ5109509

Johannes Greiner, Manuel Bodirsky

Publication date: 12 May 2020

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (3)

Unnamed Item ⋮ A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP ⋮ Tractable combinations of theories via sampling

Cites Work

• Unnamed Item
• Unnamed Item
• Permutations on the random permutation
• Invariant measures via inverse limits of finite structures
• The complexity of equality constraint languages
• The wonderland of reflections
• Complexity of combinations of qualitative constraint satisfaction problems
• Homogeneous permutations
• \(\Lambda \)-ultrametric spaces and lattices of equivalence relations
• A Model-Theoretic View on Qualitative Constraint Reasoning
• THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING C-RELATION
• Constraint Satisfaction with Countable Homogeneous Templates
• Non-dichotomies in Constraint Satisfaction Complexity
• The complexity of temporal constraint satisfaction problems
• Simplification by Cooperating Decision Procedures
• The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
• Constraint satisfaction problems for reducts of homogeneous graphs
• The Complexity of Phylogeny Constraint Satisfaction
• The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems
• A complexity dichotomy for poset constraint satisfaction
• Countable Homogeneous Tournaments
• Quantifier-free interpolation in combinations of equality interpolating theories

This page was built for publication: