Abstract
All steps described in the preceding section for fixed m are certainly covered by the rather crude bound of \(O(m(n^{5 + \varepsilon } + n^3 (log|f|)^{2 + \varepsilon } ))\) bit operations. For a factor p of degree \(k \leqslant \frac{n}{2}\) this bound applies for m=2,4,... until some m with m/2<k≤m is reached. The sum of the corresponding time bounds is therefore \(O(k(n^{5 + \varepsilon } + n^3 (log|f|)^{2 + \varepsilon } ))\). Further factors are found in the very same way, dealing with f/p, etc. There is at most one factor of degree k>n/2 (possibly f itself), thus the final time bound \(O(n^{6 + \varepsilon } + n^4 (log|f|)^{2 + \varepsilon } ))\) is obtained.
It should be observed that the distinctions between the real and complex case in Lemma 6.1 and in Lemma 6.2 nicely match such that in both cases log B∼6mn+2(m+n) log|f|. Due to the estimation (6.1) sometimes shortcuts in the reduction process may be possible. As soon as |b *m |2 becomes greater than 3·22m-1|f|2, bm can be eliminated from the reduction, etc.
It is conceivable that further (mainly theoretical) improvements of our algorithm are possible, for instance by exploiting fast matrix multiplication, or by iterating the block reduction technique.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. Kaltofen: On the complexity of finding short vectors in integer lattices. Proc. EUROCAL '83, Lecture Notes Comp. Sci.
A.K. Lenstra: Polynomial factorization by root approximation. Preprint, mathem. centrum, Amsterdam 1983.
A.K. Lenstra, H.W. Lenstra, Jr., L. Lovász: Factoring polynomials with rational coefficients. Math. Ann. 261 (1982), 515–534.
A. Schönhage: The fundamental theorem of algebra in terms of computational complexity. Preliminary Report, Math. Inst. Univ. Tübingen, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schönhage, A. (1984). Factorization of univariate integer polynomials by diophantine approximation and an improved basis reduction algorithm. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_40
Download citation
DOI: https://doi.org/10.1007/3-540-13345-3_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13345-2
Online ISBN: 978-3-540-38886-9
eBook Packages: Springer Book Archive