37 search results - page 1 / 8 » On the Degree of Univariate Polynomials Over the Integers |
ECCC
2011
12 years 8 months ago
2011
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}?
CORR
2006
Springer
13 years 4 months ago
2006
Springer
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
CALC
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. This talk is a brief survey of recent results and ideas concerning the problem of finding a small root of a univariate polynomial mod N, and the companion problem of fi...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
TCS
2008
13 years 4 months ago
2008
We present exact and complete algorithms based on precomputed Sturm-Habicht sequences, discriminants and invariants, that classify, isolate with rational points and compare the re...