Arithmetic Circuits: A Chasm at Depth 3 (Q2816300): Difference between revisions

@@ 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.1137/140957123
@@ Property / full work available at URL: https://doi.org/10.1137/140957123 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2467589244
@@ Property / OpenAlex ID: W2467589244 / rank @@
+Normal rank
@@ Property / cites work @@
+FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
+Normal rank
@@ Property / cites work @@
+Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
+Normal rank
@@ Property / cites work @@
+On computing the determinant in small parallel time using a small number of processors
+Normal rank
@@ Property / cites work @@
+Fast Parallel Matrix Inversion Algorithms
@@ Property / cites work: Fast Parallel Matrix Inversion Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM
+Normal rank
@@ Property / cites work @@
+Q5611105
@@ Property / cites work: Q5611105 / rank @@
+Normal rank
@@ Property / cites work @@
+Sums of Like Powers of Multivariate Linear Forms
@@ Property / cites work: Sums of Like Powers of Multivariate Linear Forms / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for depth 4 formulas computing iterated matrix multiplication
+Normal rank
@@ Property / cites work @@
+Q4542578
@@ Property / cites work: Q4542578 / rank @@
+Normal rank
@@ Property / cites work @@
+Exponential lower bounds for depth 3 arithmetic circuits in algebras of functions over finite fields.
+Normal rank
@@ Property / cites work @@
+Approaching the Chasm at Depth Four
@@ Property / cites work: Approaching the Chasm at Depth Four / rank @@
+Normal rank
@@ Property / cites work @@
+Q3942397
@@ Property / cites work: Q3942397 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3105730
@@ Property / cites work: Q3105730 / rank @@
+Normal rank
@@ Property / cites work @@
+Derandomizing polynomial identity tests means proving circuit lower bounds
+Normal rank
@@ Property / cites work @@
+A super-polynomial lower bound for regular arithmetic formulas
+Normal rank
@@ Property / cites work @@
+Arithmetic circuits: the chasm at depth four gets wider
+Normal rank
@@ Property / cites work @@
+Q5501853
@@ Property / cites work: Q5501853 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing Valiant's algebraic complexity classes
+Normal rank
@@ Property / cites work @@
+Lower bounds on arithmetic circuits via partial derivatives
+Normal rank
@@ Property / cites work @@
+Tensor-Rank and Lower Bounds for Arithmetic Formulas
+Normal rank
@@ Property / cites work @@
+Q3851094
@@ Property / cites work: Q3851094 / rank @@
+Normal rank
@@ Property / cites work @@
+The Power of Depth 2 Circuits over Algebras
@@ Property / cites work: The Power of Depth 2 Circuits over Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Diagonal Circuit Identity Testing and Lower Bounds
+Normal rank
@@ Property / cites work @@
+Affine projections of symmetric polynomials.
@@ Property / cites work: Affine projections of symmetric polynomials. / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-3 arithmetic circuits over fields of characteristic zero
+Normal rank
@@ Property / cites work @@
+Arithmetic Circuits: A survey of recent results and open questions
+Normal rank
@@ Property / cites work @@
+Improved Bounds for Reduction to Depth 4 and Depth 3
+Normal rank
@@ Property / cites work @@
+Fast Parallel Computation of Polynomials Using Few Processors
+Normal rank
@@ Property / cites work @@
+Q5421717
@@ Property / cites work: Q5421717 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2816300