Treffer: Distances from differences of roots of polynomials to the nearest integers
Title:
Distances from differences of roots of polynomials to the nearest integers
Authors:
Source:
Information processing letters. 43(3):143-146
Publisher Information:
Amsterdam: Elsevier Science, 1992.
Publication Year:
1992
Physical Description:
print, 19 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Analyse algorithme, Algorithm analysis, Análisis algoritmo, Anneau, Ring, Anillo, Commutativité, Commutativity, Conmutatividad, Complexité calcul, Computing complexity, Complejidad cálculo, Equation différentielle, Differential equation, Ecuación diferencial, Informatique théorique, Computer theory, Informática teórica, Limite inférieure, Lower bound, Límite inferior, Nombre entier, Integer, Entero, Polynôme, Polynomial, Polinomio, Système informatique, Computer system, Sistema informático
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Russian acad. sci., inst. radioeng. electronics, Moscow 103907, Ussr
ISSN:
0020-0190
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.4352711
Database:
PASCAL Archive
Weitere Informationen
We present tight bounds for distances from differences of roots of the polynomial f(x)∈R[x] over a discrete normed commutative ring R without zero divisors to the nearest element of R. In the case most interesting for applications, R=Z, an algorithm for the determination of the existence of nonzero integers among these differences in time (n4log(H(f)+1))1+ε is given. This problem arises when constructing algorithms for solving some systems of ODE.