On the Degree of Univariate Polynomials Over the Integers

12 years 7 months ago

Download www.cs.technion.ac.il

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}?

Gil Cohen, Amir Shpilka, Avishay Tal

Real-time Traffic

ECCC 2011 | ECommerce | Minimal Degree | Polynomial | Roche |

claim paper

» Finding Small Solutions to Small Degree Polynomials

» Univariate Polynomial Real Root Isolation Continued Fractions Revisited

» Real algebraic numbers and polynomial systems of small degree

» AverageCase Complexity of Learning Polynomials

» Univariate Algebraic Kernel and Application to Arrangements

» A Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers

» Efficient and ErrorCorrecting Data Structures for Membership and Polynomial Evaluation

» Fast Modular Composition in any Characteristic

Post Info
More Details (n/a)

Added	27 Aug 2011
Updated	27 Aug 2011
Type	Journal
Year	2011
Where	ECCC
Authors	Gil Cohen, Amir Shpilka, Avishay Tal

Comments (0)

Sciweavers

On the Degree of Univariate Polynomials Over the Integers

ECCC 2011 | ECommerce | Minimal Degree | Polynomial | Roche |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers