Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
From MaRDI portal
Publication:3654372
DOI10.1137/070694879zbMath1191.68354OpenAlexW2067476801MaRDI QIDQ3654372
Publication date: 6 January 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070694879
Related Items (10)
Derandomization and absolute reconstruction for sums of powers of linear forms ⋮ A generalized Sylvester–Gallai-type theorem for quadratic polynomials ⋮ Sparse multivariate polynomial interpolation on the basis of Schubert polynomials ⋮ Absolute reconstruction for sums of powers of linear forms: degree 3 and beyond ⋮ Sylvester-Gallai type theorems for quadratic polynomials ⋮ Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in ⋮ Random arithmetic formulas can be reconstructed efficiently ⋮ Read-once polynomial identity testing ⋮ The NOF multiparty communication complexity of composed functions ⋮ A generalized sylvester-gallai type theorem for quadratic polynomials
This page was built for publication: Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates
