Articles by Amir Shpilka
|
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 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 10, Article 18 (pp 465-514)
On Reconstruction and Testing of Read-Once Formulas by Amir Shpilka and Ilya Volkovich |
|
Vol 7, Article 1 (pp 1-18)
Noisy Interpolating Sets for Low-Degree Polynomials by Zeev Dvir and Amir Shpilka |
|
Vol 2, Article 10 (pp 185-206)
Learning Restricted Models of Arithmetic Circuits by Adam Klivans and Amir Shpilka |