## 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 language | English |
---|---|

Title of host publication | STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing |

Editors | Samir Khuller, Virginia Vassilevska Williams |

Publisher | Association for Computing Machinery |

Pages | 259-271 |

Number of pages | 13 |

ISBN (Electronic) | 9781450380539 |

DOIs | |

State | Published - 15 Jun 2021 |

Event | 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 - Virtual, Online, Italy Duration: 21 Jun 2021 → 25 Jun 2021 |

### Publication series

Name | Proceedings of the Annual ACM Symposium on Theory of Computing |
---|---|

ISSN (Print) | 0737-8017 |

### Conference

Conference | 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 |
---|---|

Country/Territory | Italy |

City | Virtual, Online |

Period | 21/06/21 → 25/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.