Article

Free access

On the additions necessary to compute certain functions

Author:

David KirkpatrickAuthors Info & Claims

STOC '72: Proceedings of the fourth annual ACM symposium on Theory of computing

Pages 94 - 101

https://doi.org/10.1145/800152.804901

Published: 01 May 1972 Publication History

PDF eReader

Abstract

We introduce a theoretical notion, strongly related to algebraic independence, which can be applied to the terms of any computable expression to derive a lower bound on the number of additions and subtractions required to compute that expression.

References

[1]

Belaga, E.C., ";On Computing Polynomials in One Variable with Initial Preconditioning of the Coefficients";, Problemi Kibernetiki 5 (1961), 7-;15.

Google Scholar

[2]

Borodin, A., ";Computational Complexity - Theory and Practice";, appear in Currents in the Theory of Computing, ed. A. Aho, Prentice Hall, Englewood Cliffs, N.J.

Google Scholar

[3]

Borodin, A., ";Horner's Rule is Uniquely Optimal";, Theory of Machines and Computations (Ed. Z. Kohari and A. Paz), 45-;58.

Google Scholar

[4]

Borodin, A. and Munro, I., ";Evaluation of Polynomials at Many Points";, Information Processing Letters, Vol. 1, No. 2, July 1971.

Digital Library

Google Scholar

[5]

Cook, S.A. and Aanderaa, S.O., ";On the Minimum Computation of Functions";, Trans. American Math. Society 142 (1969), 291-;314.

Crossref

Google Scholar

[6]

Fiduccia, C.M., ";Fast Matrix Multiplication";, Proc. Third Annual ACM Symposium on Theory of Computing, 45-;49.

Digital Library

Google Scholar

[7]

Knuth, D.E., The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, Addison-Wesley (1969), Don Mills.

Digital Library

Google Scholar

[8]

Motzkin, T.S., ";Evaluation of Polynomials and Evaluation of Rational Functions";, Bulletin of American Mathematical Society 61 (1955), 163.

Google Scholar

[9]

Munro, I., ";Some Results Concerning Efficient and Optimal Algorithms";, Proceedings of the Third Annual ACM Symposium on Theory of Computing (1971), 40-;44.

Digital Library

Google Scholar

[10]

Munro, I. and Patterson, M., ";Optimal Algorithms for Parallel Polynomial Evaluation";, Conf. Record Twelfth Annual Symposium on Switching and Automata Theory (1971), 132-;9.

Digital Library

Google Scholar

[11]

Ostrowski, A.M., ";On Two Problems in Abstract Algebra Connected with Horner's Rule";, Studies presented to R. von Mises, Academic Press, New York, 1954, 40-;48.

Google Scholar

[12]

Pan, V. Ya, ";Methods of Computing Values of Polynomials";, Russian Mathematical Surveys, Vol. 21, No. 1, 105-;6.

Google Scholar

[13]

Winograd, S., ";On the Number of Multiplications Necessary to Compute Certain Functions";, Comm. Pure and Applied Math., Vol. 23, 1970, 165-;179.

Crossref

Google Scholar

[14]

Winograd, S., ";On the Algebraic Complexity of Functions";, IBM Report, Nov. 1968.

Google Scholar

[15]

Kirkpatrick, D.G.,. ";On the Additions Necessary to Compute Certain Functions";, Technical Report No. 39, Department of Computer Science, University of Toronto.

Google Scholar

Cited By

View all

Pan V(1978)Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operationsProceedings of the 19th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1978.34(166-176)Online publication date: 16-Oct-1978
https://dl.acm.org/doi/10.1109/SFCS.1978.34
Shaw MTraub J(1972)On the number of multiplications for the evaluation of a polynomial and all its derivativesProceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)10.1109/SWAT.1972.14(105-107)Online publication date: 25-Oct-1972
https://dl.acm.org/doi/10.1109/SWAT.1972.14
Munro IPaterson M(1971)Optimal algorithms for parallel polynomial evaluationProceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)10.1109/SWAT.1971.23(132-139)Online publication date: 13-Oct-1971
https://dl.acm.org/doi/10.1109/SWAT.1971.23

Index Terms

On the additions necessary to compute certain functions
1. Mathematics of computing
  1. Mathematical analysis
    1. Numerical analysis
2. Theory of computation
  1. Computational complexity and cryptography
    1. Complexity classes
  2. Models of computation
    1. Computability
      1. Turing machines

Recommendations

On L-functions of certain exponential sums

Let F"q denote the finite field of order q of characteristic p. We study the p-adic valuations for zeros of L-functions associated with exponential sums of the following family of Laurent polynomialsf(x)=a"1x"n"+"1(x"1+1x"1)+...+a"nx"n"+"1(x"n+1x"n)+a"n"...
Szegö quadrature formulas for certain Jacobi-type weight functions

In this paper we are concerned with the estimation of integrals on the unit circle of the form ∫₀^2π f(e^iθ)ω(θ)dθ by means of the so-called Szegö quadrature formulas, i.e., formulas of the type Σ_j=1ⁿ λ_jf(x_j) with distinct nodes on the unit circle, ...
Certain classes of series associated with the Zeta and related functions
Special issue: Advanced special functions and related topics in differential equations, third Melfi workshop, proceedings of the Melfi school on advanced topics in mathematics and physics

A fascinatingly large number of seemingly independent solutions of the so-called Basler problem of evaluating the Riemann Zeta function @z(s) when s=2, which was of vital importance to Leonhard Euler (1707-1783) and the Bernoulli brothers (Jakob ...

Comments

Information & Contributors

Information

Published In

STOC '72: Proceedings of the fourth annual ACM symposium on Theory of computing

May 1972

275 pages

ISBN:9781450374576

DOI:10.1145/800152

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 1972

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
80
Total Downloads

Downloads (Last 12 months)30
Downloads (Last 6 weeks)5

Reflects downloads up to 06 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pan V(1978)Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operationsProceedings of the 19th Annual Symposium on Foundations of Computer Science10.1109/SFCS.1978.34(166-176)Online publication date: 16-Oct-1978
https://dl.acm.org/doi/10.1109/SFCS.1978.34
Shaw MTraub J(1972)On the number of multiplications for the evaluation of a polynomial and all its derivativesProceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)10.1109/SWAT.1972.14(105-107)Online publication date: 25-Oct-1972
https://dl.acm.org/doi/10.1109/SWAT.1972.14
Munro IPaterson M(1971)Optimal algorithms for parallel polynomial evaluationProceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)10.1109/SWAT.1971.23(132-139)Online publication date: 13-Oct-1971
https://dl.acm.org/doi/10.1109/SWAT.1971.23

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

On L-functions of certain exponential sums

Szegö quadrature formulas for certain Jacobi-type weight functions

Certain classes of series associated with the Zeta and related functions

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

On L-functions of certain exponential sums

Szegö quadrature formulas for certain Jacobi-type weight functions

Certain classes of series associated with the Zeta and related functions

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations