Arithmetic Circuits and Polynomial Replacement Systems
From MaRDI portal
Publication:4651522
DOI10.1137/S009753970139207XzbMath1101.68567MaRDI QIDQ4651522
Pierre McKenzie, Heribert Vollmer, Klaus W. Wagner
Publication date: 21 February 2005
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Polynomials in number theory (11C08) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
This page was built for publication: Arithmetic Circuits and Polynomial Replacement Systems