Articles under category:
Algebraic Complexity
Algebraic Complexity
Vol 17, Article 10 (pp 1-88)
[CCC16 Spec Issue]
Proof Complexity Lower Bounds from Algebraic Circuit Complexity by Michael A. Forbes, Amir Shpilka, Iddo Tzameret, and Avi Wigderson |
Vol 17, Article 1 (pp 1-30)
[CCC19 Spec Issue]
Limits on the Universal Method for Matrix Multiplication by Josh Alman |
Vol 15, Article 16 (pp 1-30)
[CCC18 Spec Issue]
Algebraic Dependencies and PSPACE Algorithms in Approximative Complexity over Any Field by Zeyu Guo, Nitin Saxena, and Amit Sinhababu |
Vol 15, Article 13 (pp 1-34)
Closure Results for Polynomial Factorization by Chi-Ning Chou, Mrinal Kumar, and Noam Solomon |
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 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 14, Article 3 (pp 1-21)
[CCC17 Spec Issue]
A Deterministic PTAS for the Commutative Rank of Matrix Spaces by Markus Bläser, Gorav Jindal, and Anurag Pandey |
Vol 13, Article 21 (pp 1-38)
[CCC16 Spec Issue]
Decoding Reed–Muller Codes over Product Sets by John Y. Kim and Swastik Kopparty |
Vol 13, Article 18 (pp 1-15)
Monotone Projection Lower Bounds from Extended Formulation Lower Bounds by Joshua A. Grochow |
Vol 12, Article 12 (pp 1-38)
Lower Bounds for Non-Commutative Skew Circuits by Nutan Limaye, Guillaume Malod, and Srikanth Srinivasan |
Vol 9, Article 6 (pp 273-282)
[NOTE]
The Complexity of the Fermionant and Immanants of Constant Width by Stephan Mertens and Cristopher Moore |
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 |