Pages that link to "Item:Q4210136"
From MaRDI portal
The following pages link to The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory (Q4210136):
Displaying 50 items.
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures (Q2427538) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- Majority functions on structures with finite duality (Q2427545) (← links)
- Constraints, MMSNP and expander relational structures (Q2439829) (← links)
- Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
- The existence of a near-unanimity function is decidable (Q2449447) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- A combinatorial characterization of resolution width (Q2475405) (← links)
- On twisted subgroups and Bol loops of odd order. (Q2477816) (← links)
- Complexity of clausal constraints over chains (Q2480746) (← links)
- Retractions onto series-parallel posets (Q2483392) (← links)
- Minimum cost and list homomorphisms to semicomplete digraphs (Q2492190) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- Building blocks for the variety of absolute retracts (Q2502901) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Obstructions to locally injective oriented improper colourings (Q2509767) (← links)
- Decidability of absorption in relational structures of bounded width. (Q2510713) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Dichotomy for finite tournaments of mixed-type (Q2515599) (← links)
- The recognition of bound quivers using edge-coloured homomorphisms (Q2566139) (← links)
- A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results (Q2575831) (← links)
- The complexity of partition functions (Q2581263) (← links)
- The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439) (← links)
- Mini-workshop: Descriptive combinatorics, LOCAL algorithms and random processes. Abstracts from the mini-workshop held February 13--19, 2022 (Q2693035) (← links)
- The constraint satisfaction problem and universal algebra (Q2795309) (← links)
- Robustly solvable constraint satisfaction problems (Q2817797) (← links)
- A complete dichotomy rises from the capture of vanishing signatures (Q2817798) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- On algebras with many symmetric operations (Q2821826) (← links)
- Adjusted interval digraphs (Q2839215) (← links)
- CSP dichotomy for special polyads (Q2852579) (← links)
- Computational complexity of various Mal'cev conditions (Q2854972) (← links)
- Obstructions to injective oriented colourings (Q2857412) (← links)
- The Complexity of Approximately Counting Tree Homomorphisms (Q2943573) (← links)
- Counting List Matrix Partitions of Graphs (Q2944567) (← links)
- Why Is It Hard to Obtain a Dichotomy for Consistent Query Answering? (Q2946755) (← links)
- Is Polynomial Time Choiceless? (Q2947174) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Logical compactness and constraint satisfaction problems (Q2980963) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- On the CSP Dichotomy Conjecture (Q3007637) (← links)
- RESIDUAL PROPERTIES OF SIMPLE GRAPHS (Q3065426) (← links)
- TERM EQUATION SATISFIABILITY OVER FINITE ALGEBRAS (Q3067781) (← links)
- Quasi-Transitive Digraphs and Their Extensions (Q3120440) (← links)
- On the Complexity of the Model Checking Problem (Q3176188) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Semantic Acyclicity on Graph Databases (Q3187172) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- The Complexity of Counting Quantifiers on Equality Languages (Q3188273) (← links)
