Polynomial Time Deterministic Identity Testing Algorithm for Σ[3]ΠΣΠ[2] Circuits via Edelstein–Kelly Type Theorem for Quadratic Polynomials

Shir Peleg, Amir Shpilka

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gupta14], 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]II?II[2] circuits.

Original languageEnglish
Title of host publicationSTOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
EditorsSamir Khuller, Virginia Vassilevska Williams
PublisherAssociation for Computing Machinery
Pages259-271
Number of pages13
ISBN (Electronic)9781450380539
DOIs
StatePublished - 15 Jun 2021
Event53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 - Virtual, Online, Italy
Duration: 21 Jun 202125 Jun 2021

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021
Country/TerritoryItaly
CityVirtual, Online
Period21/06/2125/06/21

Keywords

  • Algebraic computation
  • Computational complexity
  • Computational geometry
  • Identity testing

Fingerprint

Dive into the research topics of 'Polynomial Time Deterministic Identity Testing Algorithm for Σ[3]ΠΣΠ[2] Circuits via Edelstein–Kelly Type Theorem for Quadratic Polynomials'. Together they form a unique fingerprint.

Cite this