Advertisement

Multiplicative complexity of a pair of bilinear forms and of the polynomial multiplication

  • D. Yu. Grigoriev
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 64)

Keywords

Bilinear Form Structure Tensor Polynomial Multiplication Main Field Closed Field 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Borodin, M. Munro, The computational complexity of algebraic and numeric problems, Ser.Theory of Computations, Amer.Elsevier, N.Y., 1975.Google Scholar
  2. 2.
    V. Strassen, Berechnung und Program 1, Acta Inform., 1, 1972, p. 320–335.CrossRefGoogle Scholar
  3. 3.
    V. Strassen, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, Numer.Math., 20, 1973, p.238–251.CrossRefGoogle Scholar
  4. 4.
    V. Strassen, Polynomials which are hard to compute, SIAM J.Comput., 3,2, 1974, p.128–149.CrossRefGoogle Scholar
  5. 5.
    S. Winograd, On the number of multiplications necessary to compute certain functions, Communs Pure and Appl. Math., 23, 1970, p.165–179.Google Scholar
  6. 6.
    V. Strassen, Vermeidung von Divisionen, J.reine und angew Math., 264, 1973, p.184–202.Google Scholar
  7. 7.
    Д.Ю. Григоряев, Об алгебраической сложности вычисления пары билинейных форм, Зап.научн.семинаров Ленингр.отд.Матем.ин-та АН СССР, 47, с.159–163, 1974.Google Scholar
  8. 8.
    Ф.Р. Гантмахер, Теория матриц, М., 1954.Google Scholar
  9. 9.
    A.A. Karatsuba, Yu. P. Ofman, Multiplication of multidigit numbers on automata, Soviet Physics Dokl., 7, 1963, p.595–596.Google Scholar
  10. 10.
    A.L. Toom, The complexity of a scheme of functional elements realizing the multiplication of integers, Soviet Math.Dokl., 4, 1963, p.714–716.Google Scholar
  11. 11.
    A. Schönhage, V. Strassen, Schnelle Multiplikation großer Zahlen, Computing, Arch.für elektr. Rechn., 7, 3–4, 1971, p.281–292.Google Scholar
  12. 12.
    A. Schönhage, Schnelle Multiplikation von Polynomen über Körpern der Charakteristik 2, Acta Inform., 7, 4, 1977, p.395–398.Google Scholar
  13. 13.
    C.M. Fiduccia, Y. Zalcstein, Algebras having linear multiplicative complexity, J.Assoc.Comput.Mach., 24, 2, 1977, p.311–331.Google Scholar
  14. 14.
    A. Grzegorczyk, Some classes of recursive functions, Rozprawy, Matematiczne IV, Warszawa, 1953, p. 1–46.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • D. Yu. Grigoriev
    • 1
  1. 1.Leningrad Branch of Mathematical Institute of Academy of ScienceLeningradUSSR

Personalised recommendations