Polynomial identity testing for depth 3 circuits
From MaRDI portal
Publication:2472430
DOI10.1007/s00037-007-0226-9zbMath1173.94470OpenAlexW2177482211MaRDI QIDQ2472430
Publication date: 22 February 2008
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-007-0226-9
Related Items (17)
Subexponential size hitting sets for bounded depth multilinear formulas ⋮ Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Unnamed Item ⋮ A case of depth-3 identity testing, sparse factorization and duality ⋮ Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ⋮ The Monomial Ideal Membership Problem and Polynomial Identity Testing ⋮ Read-once polynomial identity testing ⋮ Recent Results on Polynomial Identity Testing ⋮ The ideal membership problem and polynomial identity testing ⋮ Depth-4 Identity Testing and Noether’s Normalization Lemma ⋮ Unnamed Item ⋮ Building above read-once polynomials: identity testing and hardness of representation ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits ⋮ Operator scaling: theory and applications ⋮ Univariate ideal membership parameterized by rank, degree, and number of generators ⋮ Improved hitting set for orbit of ROABPs ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
This page was built for publication: Polynomial identity testing for depth 3 circuits
