This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
Literature
J. Heintz, M. Sieveking to appear in Theoretical Computer Science
V. Strassen Polynomials with rational coefficients which are hard to compute. Siam J. Comput. Vol. 3 No. 2 June 1974
C.P. Schnorr Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials. in: Proceedings of the 6th International MFCS Symposium, High Tatras 1977. Springer: Lecture Notes in Computer Science 53
S. Lang Introduction to algebraic geometry 1964
J. Heintz Definability bounds in algebraically closed fields and a note on degree in affine algebraic geometry. 1977 unpublished
Editor information
Rights and permissions
Copyright information
© 1979 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heintz, J. (1979). A new method to show lower bounds for polynomials which are hard to compute. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-09118-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09118-9
Online ISBN: 978-3-540-35517-5
eBook Packages: Springer Book Archive