scientific article; zbMATH DE number 7566067
From MaRDI portal
Publication:5094139
Johannes Greiner, Jakub Rydval, Manuel Bodirsky
Publication date: 2 August 2022
Full work available at URL: https://arxiv.org/abs/2012.05682
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutations on the random permutation
- Model-theoretic methods in combined constraint satisfiability
- The complexity of equality constraint languages
- Complexity, convexity and combinations of theories
- Cyclic ordering is NP-complete
- Disjunctions, independence, refinements
- Unions of non-disjoint theories and combinations of satisfiability procedures
- Tractable combinations of theories via sampling
- Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups
- Schaefer's Theorem for Graphs
- The 42 reducts of the random ordered graph
- The reducts of equality up to primitive positive interdefinability
- Complexity of Infinite-Domain Constraint Satisfaction
- Constraint Satisfaction with Countable Homogeneous Templates
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL
- The complexity of temporal constraint satisfaction problems
- Simplification by Cooperating Decision Procedures
- Total Ordering Problem
- Reasoning about temporal relations
- A complexity dichotomy for poset constraint satisfaction
- Scheduling with AND/OR Precedence Constraints
- Tractable Set Constraints
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP
- Temporal Constraint Satisfaction Problems in Fixed-Point Logic
- Tractability of quantified temporal constraints to the max
- Constraint Satisfaction Problems for Reducts of Homogeneous Graphs
- The Complexity of Phylogeny Constraint Satisfaction Problems
- The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
This page was built for publication:
