scientific article; zbMATH DE number 6395190

DOI10.4086/toc.2014.v010a018zbMath1319.68113OpenAlexW2403165824MaRDI QIDQ5497117

Amir Shpilka, Ilya Volkovich

Publication date: 3 February 2015

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2014.v010a018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

reconstructionarithmetic circuitsread-once formulasbounded-depth circuitsidentity testing

Mathematics Subject Classification ID

Related Items (4)

Sums of read-once formulas: how many summands are necessary? ⋮ Unnamed Item ⋮ Sums of Read-Once Formulas: How Many Summands Suffice? ⋮ Characterizing Arithmetic Read-Once Formulae

Cites Work

• The ideal membership problem and polynomial identity testing

This page was built for publication: