Author of the publication

Polynomials with Rational Coefficients Which are Hard to Compute.

. SIAM J. Comput., 3 (2): 128-149 (1974)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication. FOCS, page 49-54. IEEE Computer Society, (1986)Berechnung und Programm. II.. Acta Inf., (1973)The Computational Complexity of Continued Fractions.. SIAM J. Comput., 12 (1): 1-27 (1983)Erratum: A Fast Monte-Carlo Test for Primality., and . SIAM J. Comput., 7 (1): 118 (1978)see: SIAM J. Comput. 6(1): 84-85.Berechnungen in partiellen Algebren endlichen Typs.. Computing, 11 (3): 181-196 (1973)The algorithmic complexity of linear algebras., and . Algorithms in Modern Mathematics and Computer Science, volume 122 of Lecture Notes in Computer Science, page 343-354. Springer, (1979)Algebraic Complexity Theory.. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A), Elsevier and MIT Press, (1990)The computational complexity of continued fractions.. SYMSACC, page 51-67. ACM, (1981)Asymptotic spectrum and matrix multiplication.. ISSAC, page 6-7. ACM, (2012)Berechnung und Programm. I.. Acta Inf., (1972)