Shir Peleg

activity

20202022

most citedLower Bounds on Stabilizer Rank

8 citations · 8 across the 3 of their papers we have counts for

collaborators

Showing cs.CCShow all

3 papers · 1 filter

cs.CC2022

Tensor Reconstruction Beyond Constant Rank

Shir Peleg, Amir Shpilka, Ben Lee Volk

We give reconstruction algorithms for subclasses of depth-3 arithmetic circuits. In particular, we obtain the first efficient algorithm for finding tensor rank, and an optimal tens…

cs.CC2020

Polynomial time deterministic identity testingalgorithm for $Σ^{[3]} ΠΣ Π^{[2]}$ 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…

Tensor Reconstruction Beyond Constant Rank

Polynomial time deterministic identity testingalgorithm for Σ[3]ΠΣΠ[2] circuits via Edelstein-Kelly type theorem for quadratic polynomials

A generalized Sylvester-Gallai type theorem for quadratic polynomials

Polynomial time deterministic identity testingalgorithm for $Σ^{[3]} ΠΣ Π^{[2]}$ circuits via Edelstein-Kelly type theorem for quadratic polynomials