Polynomial time deterministic identity testingalgorithm for $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$ circuits via Edelstein-Kelly type theorem for quadratic polynomials
Computational Complexity
2020-06-16 v1
Abstract
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 immediate corollary we obtain the first deterministic polynomial time black-box algorithm for testing zeroness of circuits.
Cite
@article{arxiv.2006.08263,
title = {Polynomial time deterministic identity testingalgorithm for $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$ circuits via Edelstein-Kelly type theorem for quadratic polynomials},
author = {Shir Peleg and Amir Shpilka},
journal= {arXiv preprint arXiv:2006.08263},
year = {2020}
}