GMSNP and finite structures
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2117181 (Why is no real title available?)
- A dichotomy theorem for nonuniform CSPs
- ASNP: a tame fragment of existential second-order logic
- Algebraic Approach to Promise Constraint Satisfaction
- An algorithmic blend of LPs and ring equations for promise CSPs
- Circular chromatic number: A survey
- Complexity of infinite-domain constraint satisfaction
- Constraints, MMSNP and expander relational structures
- Duality theorems for finite structures (characterising gaps and good characterisations)
- Forbidden tournaments and the orientation completion problem
- Graph Theory and Probability
- Graph theory
- Hereditarily hard \(H\)-colouring problems
- On unavoidable digraphs in orientations of graphs
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- PROJECTIVE CLONE HOMOMORPHISMS
- Promise and infinite-domain constraint satisfaction
- Small Promise CSPs that reduce to large CSPs
- Star chromatic numbers of graphs
- The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- The generic circular triangle-free graph
- The wonderland of reflections
- Universal Structures and the logic of Forbidden Patterns
This page was built for publication: GMSNP and finite structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7228638)
