Skip to main content
SpringerLink
Log in

A lower bound for the formula size of rational functions

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1982)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. CSANKY. Fast parallel inversion algorithms. SIAM J. on Computing, Vol. 5, No. 4 (1976), 618–623.

    Article  MathSciNet  Google Scholar 

  2. L. HYAFIL. On the parallel evaluation of multivariate polynomials. Proc. Tenth ACM Symp. on Theory of Computing (1978), 193–195.

    Google Scholar 

  3. B.M. KLOSS. Estimates of the complexity of solutions of systems of linear equations. Dokl. Akad. Nauk. SSSR, Vol. 171, No. 4 (1966), pp. 781–783. Sov. Math. Dokl., Vol. 7, No. 6 (1966), pp. 1537–1540.

    MathSciNet  Google Scholar 

  4. è.I. NEČIPORUK. A Boolean function. Dokl. Akad. Nauk. SSSR, Vol. 169, No. 4 (1966), pp. 765–766. Sov. Math. Dokl., Vol. 7, No. 4 (1966), pp. 999–1000.

    MathSciNet  Google Scholar 

  5. J.E. SAVAGE. The complexity of computing. Wiley, New York (1976).

    MATH  Google Scholar 

  6. O. ZARISKI and P. SAMUEL. Commutative Algebra. Van Nostrand, Princeton, N.J. (1958) (2 volumes).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Edinburgh University, EH9 3JZ, Edinburgh, Scotland

    K. A. Kalorkoti

Authors
  1. K. A. Kalorkoti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kalorkoti, K.A. (1982). A lower bound for the formula size of rational functions. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012780

Download citation

  • DOI: https://doi.org/10.1007/BFb0012780

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation