Skip to main content
SpringerLink
Log in

Some results on the complexity of powers

  • Chapter
  • First Online:
Computation Theory and Logic

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 270))

  • 136 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baur W, Strassen V (1983) The complexity of partial derivatives. Theoret Comp Sci 22: 317–330

    Google Scholar 

  2. Knuth DE (1981) The art of computer programming, 2nd edn, vol 2, Seminumerical algorithms. Addison-Wesley, Reading MA

    Google Scholar 

  3. Schönhage A (1975) A lower bound on the length of addition chains. Theoret Comp Sci 1: 1–12

    Google Scholar 

  4. Strassen V (1973) Die Berechnungskomplexität der elementar-symmetrischen Funktionen und von Interpolationskoeffizienten. Num Math 20: 238–251

    Google Scholar 

  5. Volger H (1985) Some results on addition/subtraction chains. Inf Proc Letters 20: 155–160

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut der Universität Tübingen, Auf der Morgenstelle 10, D-7400, Tübingen, W. Germany

    T. Lickteig & H. Volger

  2. Fakultät für Mathematik und Informatik der Universität Passau, Innstr. 27, D-8390, Passau, W. Germany

    H. Volger

Authors
  1. T. Lickteig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Volger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Lickteig, T., Volger, H. (1987). Some results on the complexity of powers. In: Börger, E. (eds) Computation Theory and Logic. Lecture Notes in Computer Science, vol 270. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18170-9_170

Download citation

  • DOI: https://doi.org/10.1007/3-540-18170-9_170

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-18170-5

  • Online ISBN: 978-3-540-47795-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation