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

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ 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
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01294256
+Normal rank
@@ Property / OpenAlex ID @@
+W2171403864
@@ Property / OpenAlex ID: W2171403864 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1377574