Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844): Difference between revisions

@@ Property / cites work @@
+On the Desirability of Acyclic Database Schemes
@@ Property / cites work: On the Desirability of Acyclic Database Schemes / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Algebraic Formulas Using a Constant Number of Registers
+Normal rank
@@ Property / cites work @@
+A Dichotomy Theorem for Polynomial Evaluation
@@ Property / cites work: A Dichotomy Theorem for Polynomial Evaluation / rank @@
+Normal rank
@@ Property / cites work @@
+On the expressive power of CNF formulas of bounded tree- and clique-width
+Normal rank
@@ Property / cites work @@
+Completeness and reduction in algebraic complexity theory
+Normal rank
@@ Property / cites work @@
+On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
+Normal rank
@@ Property / cites work @@
+Counting truth assignments of formulas of bounded tree-width or clique-width
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of acyclic conjunctive queries
@@ Property / cites work: The complexity of acyclic conjunctive queries / rank @@
+Normal rank
@@ Property / cites work @@
+On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
+Normal rank
@@ Property / cites work @@
+On the Expressive Power of Planar Perfect Matching and Permanents of Bounded Treewidth Matrices
+Normal rank
@@ Property / cites work @@
+Characterizing Valiant's algebraic complexity classes
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Parallel Computation of Polynomials Using Few Processors
+Normal rank