\((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's

DOI10.1007/978-3-031-20350-3_14OpenAlexW4313349239MaRDI QIDQ6111953

Shaopeng Zhu, William I. Gasarch, Michael Chris Laskowski

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-20350-3_14

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• The core of a graph
• On the complexity of H-coloring
• Mutual algebraicity and cellularity
• Schaefer's Theorem for Graphs
• Complexity of Infinite-Domain Constraint Satisfaction
• Constraint Satisfaction Problems over the Integers with Successor
• Non-dichotomies in Constraint Satisfaction Complexity
• The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
• The complexity of temporal constraint satisfaction problems
• The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
• On the Structure of Polynomial Time Reducibility
• The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
• Discrete Temporal Constraint Satisfaction Problems
• A Dichotomy for First-Order Reducts of Unary Structures
• Mutually algebraic structures and expansions by predicates
• Constraint Satisfaction Problems over Numeric Domains
• A Proof of the CSP Dichotomy Conjecture
• Constraint Satisfaction Problems for Reducts of Homogeneous Graphs

This page was built for publication: \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's