Lower bounds on arithmetic circuits via partial derivatives (Q1377574): Difference between revisions

@@ Property / cites work @@
+A Certain Class of Incidence Matrices
@@ Property / cites work: A Certain Class of Incidence Matrices / rank @@
+Normal rank
@@ Property / cites work @@
+On the depth complexity of formulas
@@ Property / cites work: On the depth complexity of formulas / rank @@
+Normal rank
@@ Property / cites work @@
+A direct version of Shamir and Snir's lower bounds on monotone circuit depth
+Normal rank
@@ Property / cites work @@
+Negation can be exponentially powerful
@@ Property / cites work: Negation can be exponentially powerful / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Parallel Computation of Polynomials Using Few Processors
+Normal rank