3 papers
cs.CG2022
Robust Sylvester-Gallai type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quad…
cs.CC2020
Polynomial time deterministic identity testingalgorithm for circuits via Edelstein-Kelly type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As…
cs.CC2020
A generalized Sylvester-Gallai type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for t…