Pages that link to "Item:Q3546332"

The following pages link to The complexity of homomorphism and constraint satisfaction problems seen from the other side (Q3546332):

Displaying 50 items.

• Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems (Q253988) (← links)
• Structural tractability of counting of solutions to conjunctive queries (Q269342) (← links)
• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Structural decompositions for problems with global constraints (Q272005) (← links)
• Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
• Tractable counting of the answers to conjunctive queries (Q389242) (← links)
• Tree projections and structural decomposition methods: minimality and game-theoretic characterization (Q393903) (← links)
• The complexity of weighted counting for acyclic conjunctive queries (Q395018) (← links)
• Enumerating homomorphisms (Q414933) (← links)
• Computing hypergraph width measures exactly (Q437685) (← links)
• Tractable structures for constraint satisfaction with truth tables (Q537902) (← links)
• New plain-exponential time classes for graph homomorphism (Q639844) (← links)
• Hybrid tractability of valued constraint problems (Q646503) (← links)
• The homomorphism domination exponent (Q648968) (← links)
• The complexity of counting homomorphisms seen from the other side (Q706636) (← links)
• Finding vertex-surjective graph homomorphisms (Q715053) (← links)
• A polynomial relational class of binary CSP (Q722101) (← links)
• Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• Approximability of clausal constraints (Q970111) (← links)
• A note on some collapse results of valued constraints (Q987814) (← links)
• Causal graphs and structurally restricted planning (Q988572) (← links)
• A note on width-parameterized SAT: an exact machine-model characterization (Q990090) (← links)
• Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination (Q991007) (← links)
• Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
• Binary constraint satisfaction problems defined by excluded topological minors (Q1633806) (← links)
• Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
• Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
• Reconfiguration in bounded bandwidth and tree-depth (Q1686224) (← links)
• The power of propagation: when GAC is enough (Q1701225) (← links)
• Counting linear extensions: parameterizations by treewidth (Q1739113) (← links)
• On singleton arc consistency for CSPs defined by monotone patterns (Q1739115) (← links)
• Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms (Q1745716) (← links)
• On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
• Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
• Parameterized modal satisfiability (Q1759682) (← links)
• The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
• Constraint satisfaction with succinctly specified relations (Q1959431) (← links)
• The treewidth of proofs (Q2013559) (← links)
• Characterizing tractability of simple well-designed pattern trees with projection (Q2035467) (← links)
• Galois connections for patterns: an algebra of labelled graphs (Q2044173) (← links)
• Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
• New limits of treewidth-based tractability in optimization (Q2118087) (← links)
• A tetrachotomy of ontology-mediated queries with a covering axiom (Q2152500) (← links)
• Graph theory in Coq: minors, treewidth, and isomorphisms (Q2209536) (← links)
• Dismantlability, connectedness, and mixing in relational structures (Q2222042) (← links)
• Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor (Q2284742) (← links)
• Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
• How many variables are needed to express an existential positive query? (Q2322719) (← links)
• Characterising the complexity of constraint satisfaction problems defined by 2-constraint forbidden patterns (Q2341755) (← links)