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

preprint2020arXivOpen access

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 $Σ^{[3]}ΠΣΠ^{[2]}$ circuits.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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

Abstract

Connections

Building this map preview

Reviews 0

Discussion 0

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