Q5111752 (Q5111752): Difference between revisions

@@ Property / cites work @@
+Möbius functions of lattices
@@ Property / cites work: Möbius functions of lattices / rank @@
+Normal rank
@@ Property / cites work @@
+A second threshold for the hard‐core model on a Bethe lattice
+Normal rank
@@ Property / cites work @@
+Holographic algorithms by Fibonacci gates
@@ Property / cites work: Holographic algorithms by Fibonacci gates / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Holant Problems
@@ Property / cites work: Computational Complexity of Holant Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Counting Matchings of Size k Is $\sharp$ W[1]-Hard
+Normal rank
@@ Property / cites work @@
+Homomorphisms are a good basis for counting small subgraphs
+Normal rank
@@ Property / cites work @@
+Q4636623
@@ Property / cites work: Q4636623 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+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 @@
+Counting Unlabelled Subtrees of a Tree is #P-complete
+Normal rank
@@ Property / cites work @@
+Approximating the Permanent
@@ Property / cites work: Approximating the Permanent / rank @@
+Normal rank
@@ Property / cites work @@
+Q5605168
@@ Property / cites work: Q5605168 / 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 <i>k</i>-B<scp>iclique</scp>
+Normal rank
@@ Property / cites work @@
+Operations with structures
@@ Property / cites work: Operations with structures / rank @@
+Normal rank
@@ Property / cites work @@
+Homomorphisms of derivative graphs
@@ Property / cites work: Homomorphisms of derivative graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3135082
@@ Property / cites work: Q3135082 / rank @@
+Normal rank
@@ Property / cites work @@
+On the foundations of combinatorial theory I. Theory of M�bius Functions
+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 @@
+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 @@
+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
@@ Property / cites work @@
+A Proof of the CSP Dichotomy Conjecture
@@ Property / cites work: A Proof of the CSP Dichotomy Conjecture / rank @@
+Normal rank