Q5092423 (Q5092423): Difference between revisions

@@ Property / cites work @@
+Q4427867
@@ Property / cites work: Q4427867 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2954991
@@ Property / cites work: Q2954991 / rank @@
+Normal rank
@@ Property / cites work @@
+Classifying the Complexity of Constraints Using Finite Algebras
+Normal rank
@@ Property / cites work @@
+The complexity of the counting constraint satisfaction problem
+Normal rank
@@ Property / cites work @@
+Complexity of Counting CSP with Complex Weights
@@ Property / cites work: Complexity of Counting CSP with Complex Weights / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of approximating conservative counting CSPs
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+The complexity of counting homomorphisms seen from the other side
+Normal rank
@@ Property / cites work @@
+Q3586724
@@ Property / cites work: Q3586724 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Parameterized circuit complexity and the \(W\) hierarchy
+Normal rank
@@ Property / cites work @@
+The relative complexity of approximate counting problems
+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 @@
+Q4521549
@@ Property / cites work: Q4521549 / rank @@
+Normal rank
@@ Property / cites work @@
+An Effective Dichotomy for the Counting Constraint Satisfaction Problem
+Normal rank
@@ Property / cites work @@
+Q2921752
@@ Property / cites work: Q2921752 / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Partitions with Finitely Many Obstructions
@@ Property / cites work: Matrix Partitions with Finitely Many Obstructions / 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 @@
+Q4736854
@@ Property / cites work: Q4736854 / rank @@
+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 @@
+Approximately Counting $H$-Colorings is $\#\mathrm{BIS}$-Hard
+Normal rank
@@ Property / cites work @@
+A Complexity Trichotomy for Approximately Counting List             <i>H</i>             -Colorings
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Hypertree decompositions and tractable queries
@@ Property / cites work: Hypertree decompositions and tractable queries / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of homomorphism and constraint satisfaction problems seen from the other side
+Normal rank
@@ Property / cites work @@
+Constraint solving via fractional edge covers
@@ Property / cites work: Constraint solving via fractional edge covers / rank @@
+Normal rank
@@ Property / cites work @@
+When is the evaluation of conjunctive queries tractable?
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Conjunctive-query containment and constraint satisfaction
+Normal rank
@@ Property / cites work @@
+The challenges of unbounded treewidth in parameterised subgraph counting problems
+Normal rank
@@ Property / cites work @@
+Q2833177
@@ Property / cites work: Q2833177 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. III. Planar tree-width
@@ Property / cites work: Graph minors. III. Planar tree-width / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. V. Excluding a planar graph
@@ Property / cites work: Graph minors. V. Excluding a planar graph / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank