On the Degree of Univariate Polynomials Over the Integers

We study the following problem raised by von zur Gathen and Roche [GR97]: What is the minimal degree of a nonconstant polynomial f : {0, . . . , n} → {0, . . . , m}?

• Type: Journal
• Year: 2011
• Where: ECCC
• Authors: Gil Cohen, Amir Shpilka, Avishay Tal
• Keywords: ECCC 2011, ECommerce, Minimal Degree, Polynomial, Roche