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):
Displayed 50 items.
- The complexity of constraint satisfaction games and QCSP (Q840700) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- The structure of bi-arc trees (Q864126) (← links)
- View-based query processing: on the relationship between rewriting, answering and losslessness (Q870266) (← links)
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights (Q881590) (← links)
- Conservative constraint satisfaction re-revisited (Q896026) (← links)
- A new line of attack on the dichotomy conjecture (Q896081) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- Computational complexity of auditing finite attributes in statistical databases (Q931731) (← links)
- Generalising submodularity and Horn clauses: Tractable optimization problems defined by tournament pair multimorphisms (Q935141) (← links)
- On the restricted homomorphism problem (Q948709) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- The Helly property and satisfiability of Boolean formulas defined on set families (Q966161) (← links)
- Absolute retracts and varieties generated by chordal graphs (Q968425) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- There are no pure relational width 2 constraint satisfaction problems (Q976077) (← links)
- CSP duality and trees of bounded pathwidth (Q986555) (← links)
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
- Existentially restricted quantified constraint satisfaction (Q1013082) (← links)
- Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
- Affine systems of equations and counting infinitary logic (Q1014638) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- The complexity of satisfiability problems: Refining Schaefer's theorem (Q1015812) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- Relatively quantified constraint satisfaction (Q1020500) (← links)
- Partially ordered connectives and monadic monotone strict NP (Q1024818) (← links)
- The SAT-UNSAT transition for random constraint satisfaction problems (Q1025462) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- A combinatorial constraint satisfaction problem dichotomy classification conjecture (Q1041203) (← links)
- Peek arc consistency (Q1044838) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Edge-switching homomorphisms of edge-coloured graphs (Q1045035) (← links)
- Congruence modularity implies cyclic terms for finite algebras (Q1047112) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
- Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
- Tropically convex constraint satisfaction (Q1635805) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Axiomatisability and hardness for universal Horn classes of hypergraphs (Q1652862) (← links)
- A complexity dichotomy for signed \(\mathbf{H}\)-colouring (Q1660261) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- Relativised homomorphism preservation at the finite level (Q1680516) (← links)
- Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees (Q1686250) (← links)
- On tree-preserving constraints (Q1688715) (← links)
- The power of propagation: when GAC is enough (Q1701225) (← links)
- The wonderland of reflections (Q1709740) (← links)