Advertisement

A lower bound for the formula size of rational functions

  • K. A. Kalorkoti
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    L. CSANKY. Fast parallel inversion algorithms. SIAM J. on Computing, Vol. 5, No. 4 (1976), 618–623.MathSciNetCrossRefGoogle Scholar
  2. [2]
    L. HYAFIL. On the parallel evaluation of multivariate polynomials. Proc. Tenth ACM Symp. on Theory of Computing (1978), 193–195.Google Scholar
  3. [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.MathSciNetGoogle Scholar
  4. [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.MathSciNetGoogle Scholar
  5. [5]
    J.E. SAVAGE. The complexity of computing. Wiley, New York (1976).zbMATHGoogle Scholar
  6. [6]
    O. ZARISKI and P. SAMUEL. Commutative Algebra. Van Nostrand, Princeton, N.J. (1958) (2 volumes).zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • K. A. Kalorkoti
    • 1
  1. 1.Department of Computer ScienceEdinburgh UniversityEdinburghScotland

Personalised recommendations