A Dichotomy Theorem for Polynomial Evaluation (Q3182924): Difference between revisions

@@ Property / author @@
-Pascal Koiran
@@ Property / author: Pascal Koiran / rank @@
-Normal rank
@@ Property / author @@
+Pascal Koiran
@@ Property / author: Pascal Koiran / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-03816-7_17
+Normal rank
@@ Property / OpenAlex ID @@
+W1957065512
@@ Property / OpenAlex ID: W1957065512 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3836529
@@ Property / cites work: Q3836529 / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness and reduction in algebraic complexity theory
+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 @@
+A dichotomy theorem for constraint satisfaction problems on a 3-element set
+Normal rank
@@ Property / cites work @@
+Complexity of generalized satisfiability counting problems
+Normal rank
@@ Property / cites work @@
+Complexity Classifications of Boolean Constraint Satisfaction Problems
+Normal rank
@@ Property / cites work @@
+The vertex-cover polynomial of a graph
@@ Property / cites work: The vertex-cover polynomial of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q4798347
@@ Property / cites work: Q4798347 / rank @@
+Normal rank
@@ Property / cites work @@
+Hard Enumeration Problems in Geometry and Combinatorics
+Normal rank
@@ Property / cites work @@
+On the algebraic complexity of some families of coloured Tutte polynomials
+Normal rank
@@ Property / cites work @@
+The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
+Normal rank
@@ Property / cites work @@
+The complexity of satisfiability problems
@@ Property / cites work: The complexity of satisfiability problems / rank @@
+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 @@
+#P-COMPLETENESS VIA MANY-ONE REDUCTIONS
@@ Property / cites work: #P-COMPLETENESS VIA MANY-ONE REDUCTIONS / rank @@
+Normal rank