Few Product Gates But Many Zeros

DOI10.1007/978-3-642-03816-7_15zbMath1250.68105OpenAlexW1485237096MaRDI QIDQ3182922

Klaus Reinhardt, Pierre McKenzie, Bernd Borchert

Publication date: 16 October 2009

Published in: Mathematical Foundations of Computer Science 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_15

Mathematics Subject Classification ID

Related Items (2)

Newton polygons and the Prouhet-Tarry-Escott problem ⋮ The Prouhet-Tarry-Escott problem for Gaussian integers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast modular transforms
• Some results on computational complexity
• The Prouhet-Tarry-Escott problem revisited
• Straight-line programs and torsion points on elliptic curves
• Nested Squares and Evaluations of Integer Products
• When Can (((X²−P)²−Q)²−R)²−S²Split into Linear Factors?
• On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials
• The Tarry-Escott Problem

This page was built for publication: Few Product Gates But Many Zeros