Some results on the complexity of powers

  • T. Lickteig
  • H. Volger
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)


Optimal Computation Degree Sequence Homogeneous Part Addition Chain Difference Degree 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baur W, Strassen V (1983) The complexity of partial derivatives. Theoret Comp Sci 22: 317–330Google Scholar
  2. 2.
    Knuth DE (1981) The art of computer programming, 2nd edn, vol 2, Seminumerical algorithms. Addison-Wesley, Reading MAGoogle Scholar
  3. 3.
    Schönhage A (1975) A lower bound on the length of addition chains. Theoret Comp Sci 1: 1–12Google Scholar
  4. 4.
    Strassen V (1973) Die Berechnungskomplexität der elementar-symmetrischen Funktionen und von Interpolationskoeffizienten. Num Math 20: 238–251Google Scholar
  5. 5.
    Volger H (1985) Some results on addition/subtraction chains. Inf Proc Letters 20: 155–160Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • T. Lickteig
    • 1
  • H. Volger
    • 1
    • 2
  1. 1.Mathematisches Institut der Universität TübingenTübingenW. Germany
  2. 2.Fakultät für Mathematik und Informatik der Universität PassauPassauW. Germany

Personalised recommendations