Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter

DOI10.1137/10848232zbMath1272.68162arXiv1011.3234OpenAlexW2015393485MaRDI QIDQ4907583

Nitin Saxena, C. Seshadhri

Publication date: 4 February 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

zbMATH Keywords

polynomial identity testingdepth-3 circuitblackbox algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items (12)

Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Unnamed Item ⋮ Deterministic polynomial identity tests for multilinear bounded-read formulae ⋮ Sylvester-Gallai type theorems for quadratic polynomials ⋮ Read-once polynomial identity testing ⋮ Recent Results on Polynomial Identity Testing ⋮ Depth-4 Identity Testing and Noether’s Normalization Lemma ⋮ Linear independence, alternants, and applications ⋮ A generalized sylvester-gallai type theorem for quadratic polynomials ⋮ Unnamed Item ⋮ Improved hitting set for orbit of ROABPs ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits

This page was built for publication: Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter