The complexity of counting homomorphisms seen from the other side
From MaRDI portal
(Redirected from Publication:706636)
Recommendations
Cites work
- scientific article; zbMATH DE number 1979521 (Why is no real title available?)
- scientific article; zbMATH DE number 1545676 (Why is no real title available?)
- scientific article; zbMATH DE number 1929968 (Why is no real title available?)
- A comparison of structural CSP decomposition methods
- A partial k-arboretum of graphs with bounded treewidth
- Complexity of generalized satisfiability counting problems
- Conjunctive-query containment and constraint satisfaction
- On the algebraic structure of combinatorial problems
- Quickly excluding a planar graph
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- When is the evaluation of conjunctive queries tractable?
Cited in
(39)- Answer Counting under Guarded TGDs
- The complexity of weighted counting for acyclic conjunctive queries
- Structural tractability of counting of solutions to conjunctive queries
- The parameterised complexity of counting connected subgraphs and graph motifs
- The challenges of unbounded treewidth in parameterised subgraph counting problems
- The complexity of counting homomorphisms to cactus graphs modulo 2
- The homomorphism domination exponent
- Counting induced subgraphs: an algebraic approach to \#W[1]-hardness
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- Counting edge-injective homomorphisms and matchings on restricted graph classes
- Parameterized counting of partially injective homomorphisms
- Towards a dichotomy theorem for the counting constraint satisfaction problem
- On recognizing graphs by numbers of homomorphisms
- Counting Subgraphs in Degenerate Graphs
- Counting Answers to Existential Questions
- Parameterised counting in logspace
- Approximability of clausal constraints
- The complexity of homomorphism and constraint satisfaction problems seen from the other side
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
- On planar valued CSPs
- Answering UCQs under updates and in the presence of integrity constraints
- Bounded Tree-Width and CSP-Related Problems
- Lov\'asz Meets Weisfeiler and Leman
- Counting induced subgraphs: an algebraic approach to \#W[1]-hardness
- Structural tractability of enumerating CSP solutions
- Counting Small Induced Subgraphs Satisfying Monotone Properties
- Parameterized Counting and Cayley Graph Expanders
- Some hard families of parameterized counting problems
- Counting problems in parameterized complexity
- Counting Homomorphic Cycles in Degenerate Graphs
- Monotone arithmetic complexity of graph homomorphism polynomials
- The Complexity of Homomorphism Indistinguishability
- Counting restricted homomorphisms via Möbius inversion over matroid lattices
- Counting Small Induced Subgraphs with Hereditary Properties
- Parameterised and fine-grained subgraph counting, modulo 2
- Counting induced subgraphs: a topological approach to \#W[1]-hardness
- scientific article; zbMATH DE number 7561704 (Why is no real title available?)
- Counting subgraphs in somewhere dense graphs
- Tractable counting of the answers to conjunctive queries
This page was built for publication: The complexity of counting homomorphisms seen from the other side
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q706636)
