On the efficiency of algorithms of analysis
- 1 April 1985
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 13 (2), 87-122
- https://doi.org/10.1090/s0273-0979-1985-15391-1
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 22 references indexed in Scilit:
- Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on AverageSIAM Journal on Computing, 1986
- On the cost of computing roots of polynomialsMathematical Programming, 1984
- Cayley’s problem and Julia setsThe Mathematical Intelligencer, 1984
- Complex analytic dynamics on the Riemann sphereBulletin of the American Mathematical Society, 1984
- On the iteration of a rational function: Computer experiments with Newton's methodCommunications in Mathematical Physics, 1983
- The Average number of pivot steps required by the Simplex-Method is polynomialMathematical Methods of Operations Research, 1982
- A History of Numerical Analysis from the 16th through the 19th CenturyPublished by Springer Nature ,1977
- The Solution of Systems of Piecewise Linear EquationsMathematics of Operations Research, 1976
- Endomorphisms of the Riemann sphereProceedings of Symposia in Pure Mathematics, 1970
- Multivalent Functions. By W. K. Hayman. Cambridge Tracts in Mathematics and Mathematical Physics, No: 48. Pp. 151. 27s. 6d. 1958. (Cambridge University Press)The Mathematical Gazette, 1960