Parameterized counting of partially injective homomorphisms (Q2032353): Difference between revisions

@@ Property / cites work @@
+Q5808057
@@ Property / cites work: Q5808057 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5002678
@@ Property / cites work: Q5002678 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorics and complexity of partition functions
+Normal rank
@@ Property / cites work @@
+Parameterized counting of trees, forests and matroid bases
+Normal rank
@@ Property / cites work @@
+From Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problems
+Normal rank
@@ Property / cites work @@
+Holographic algorithms: from art to science
@@ Property / cites work: Holographic algorithms: from art to science / rank @@
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSP
+Normal rank
@@ Property / cites work @@
+Q4608007
@@ Property / cites work: Q4608007 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Strong computational lower bounds via parameterized complexity
+Normal rank
@@ Property / cites work @@
+Counting Matchings of Size k Is $\sharp$ W[1]-Hard
+Normal rank
@@ Property / cites work @@
+Q4967222
@@ Property / cites work: Q4967222 / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms are a good basis for counting small subgraphs
+Normal rank
@@ Property / cites work @@
+Parameterized Algorithms
@@ Property / cites work: Parameterized Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+Counting Answers to Existential Questions
@@ Property / cites work: Counting Answers to Existential Questions / rank @@
+Normal rank
@@ Property / cites work @@
+Counting \(H-\)colorings of partial \(k-\)trees
@@ Property / cites work: Counting \(H-\)colorings of partial \(k-\)trees / rank @@
+Normal rank
@@ Property / cites work @@
+An approximation trichotomy for Boolean \#CSP
@@ Property / cites work: An approximation trichotomy for Boolean \#CSP / rank @@
+Normal rank
@@ Property / cites work @@
+The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
+Normal rank
@@ Property / cites work @@
+Locally constrained graph homomorphisms -- structure, complexity, and applications
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of Counting Problems
@@ Property / cites work: The Parameterized Complexity of Counting Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Unlabelled Subtrees of a Tree is #P-complete
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On tree width, bramble size, and expansion
@@ Property / cites work: On tree width, bramble size, and expansion / rank @@
+Normal rank
@@ Property / cites work @@
+Zeros of Holant problems: locations and algorithms
+Normal rank
@@ Property / cites work @@
+\(A\,V^ 2\) algorithm for determining isomorphism of planar graphs
+Normal rank
@@ Property / cites work @@
+A dichotomy for real weighted Holant problems
@@ Property / cites work: A dichotomy for real weighted Holant problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Counting trees in a graph is \(\# \text{P}\)-complete
+Normal rank
@@ Property / cites work @@
+Approximating the Permanent
@@ Property / cites work: Approximating the Permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The statistics of dimers on a lattice
@@ Property / cites work: The statistics of dimers on a lattice / rank @@
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+The Parameterized Complexity of the             <i>k</i>             -Biclique Problem
+Normal rank
@@ Property / cites work @@
+Q4899293
@@ Property / cites work: Q4899293 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002818
@@ Property / cites work: Q3002818 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the graph isomorphism counting problem
@@ Property / cites work: A note on the graph isomorphism counting problem / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
+Normal rank
@@ Property / cites work @@
+Parameterized counting problems
@@ Property / cites work: Parameterized counting problems / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms of derivative graphs
@@ Property / cites work: Homomorphisms of derivative graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Size Bounds for Factorised Representations of Query Results
+Normal rank
@@ Property / cites work @@
+Q5390304
@@ Property / cites work: Q5390304 / rank @@
+Normal rank
@@ Property / cites work @@
+On the foundations of combinatorial theory I. Theory of M�bius Functions
+Normal rank
@@ Property / cites work @@
+Counting Restricted Homomorphisms via Möbius Inversion over Matroid Lattices
+Normal rank
@@ Property / cites work @@
+Counting induced subgraphs: a topological approach to \#W[1]-hardness
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3748279
@@ Property / cites work: Q3748279 / rank @@
+Normal rank
@@ Property / cites work @@
+Dimer problem in statistical mechanics-an exact result
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting in Sparse, Regular, and Planar Graphs
+Normal rank
@@ Property / cites work @@
+The complexity of computing the permanent
@@ Property / cites work: The complexity of computing the permanent / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / cites work @@
+Holographic Algorithms
@@ Property / cites work: Holographic Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Computational complexity of counting problems on 3-regular planar graphs
+Normal rank