Polynomial time deterministic identity testing algorithm for Σ [3] ΠΣΠ [2] circuits via Edelstein–Kelly type theorem for quadratic polynomials

DOI10.1145/3406325.3451013arXiv2006.08263OpenAlexW3037624630MaRDI QIDQ6086999

Shir Peleg, Amir Shpilka

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.08263

zbMATH Keywords

computational complexitycomputational geometryalgebraic computationidentity testing

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

A generalized Sylvester–Gallai-type theorem for quadratic polynomials

This page was built for publication: Polynomial time deterministic identity testing algorithm for Σ ^[3] ΠΣΠ ^[2] circuits via Edelstein–Kelly type theorem for quadratic polynomials