Articles under category:
Arithmetic Circuits
Arithmetic Circuits
Vol 15, Article 8 (pp 1-7)
[NOTE]
Matrix Rigidity and the Croot-Lev-Pach Lemma by Zeev Dvir and Benjamin L. Edelman |
Vol 15, Article 7 (pp 1-36)
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits by Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, and S. Raja |
Vol 14, Article 18 (pp 1-45)
Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits by Michael A. Forbes, Amir Shpilka, and Ben Lee Volk |
Vol 14, Article 16 (pp 1-46)
On the Size of Homogeneous and of Depth-Four Formulas with Low Individual Degree by Neeraj Kayal, Chandan Saha, and Sébastien Tavenas |
Vol 13, Article 9 (pp 1-34)
The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials by Hervé Fournier, Nutan Limaye, Meena Mahajan, and Srikanth Srinivasan |
Vol 13, Article 6 (pp 1-33)
[CCC16 Spec Issue]
Arithmetic Circuits with Locally Low Algebraic Rank by Mrinal Kumar and Shubhangi Saraf |
Vol 12, Article 12 (pp 1-38)
Lower Bounds for Non-Commutative Skew Circuits by Nutan Limaye, Guillaume Malod, and Srikanth Srinivasan |
Vol 11, Article 14 (pp 357-393)
Non-Commutative Arithmetic Circuits with Division by Pavel Hrubeš and Avi Wigderson |
Vol 10, Article 18 (pp 465-514)
On Reconstruction and Testing of Read-Once Formulas by Amir Shpilka and Ilya Volkovich |
Vol 9, Article 10 (pp 403-411)
On the Real $\tau$-Conjecture and the Distribution of Complex Roots by Pavel Hrubeš |
Vol 7, Article 13 (pp 185-188)
[NOTE]
Computing Polynomials with Few Multiplications by Shachar Lovett |
Vol 7, Article 8 (pp 119-129)
Arithmetic Complexity in Ring Extensions by Pavel Hrubeš and Amir Yehudayoff |
Vol 6, Article 7 (pp 135-177)
Elusive Functions and Lower Bounds for Arithmetic Circuits by Ran Raz |
Vol 2, Article 10 (pp 185-206)
Learning Restricted Models of Arithmetic Circuits by Adam Klivans and Amir Shpilka |
Vol 2, Article 6 (pp 121-135)
Separation of Multilinear Circuit and Formula Size by Ran Raz |